./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 73a9ab851ce1c73d80f83f7e6335d12ad87baacd38ef2209152d18ccc2128259
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2024-02-28 18:34:07,239 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2024-02-28 18:34:07,240 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2024-02-28 18:34:07,260 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2024-02-28 18:34:07,261 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2024-02-28 18:34:07,262 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2024-02-28 18:34:07,262 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2024-02-28 18:34:07,264 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2024-02-28 18:34:07,265 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2024-02-28 18:34:07,265 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2024-02-28 18:34:07,266 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2024-02-28 18:34:07,267 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2024-02-28 18:34:07,267 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2024-02-28 18:34:07,268 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2024-02-28 18:34:07,269 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2024-02-28 18:34:07,269 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2024-02-28 18:34:07,270 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2024-02-28 18:34:07,271 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2024-02-28 18:34:07,272 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2024-02-28 18:34:07,273 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2024-02-28 18:34:07,274 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2024-02-28 18:34:07,275 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2024-02-28 18:34:07,275 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2024-02-28 18:34:07,276 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2024-02-28 18:34:07,278 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2024-02-28 18:34:07,278 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2024-02-28 18:34:07,279 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2024-02-28 18:34:07,279 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2024-02-28 18:34:07,279 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2024-02-28 18:34:07,280 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2024-02-28 18:34:07,280 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2024-02-28 18:34:07,281 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2024-02-28 18:34:07,281 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2024-02-28 18:34:07,282 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2024-02-28 18:34:07,282 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2024-02-28 18:34:07,283 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2024-02-28 18:34:07,283 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2024-02-28 18:34:07,283 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2024-02-28 18:34:07,283 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2024-02-28 18:34:07,284 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2024-02-28 18:34:07,284 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2024-02-28 18:34:07,285 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-02-28 18:34:07,298 INFO  L113        SettingsManager]: Loading preferences was successful
[2024-02-28 18:34:07,299 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2024-02-28 18:34:07,299 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-02-28 18:34:07,299 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-02-28 18:34:07,299 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-02-28 18:34:07,302 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-02-28 18:34:07,303 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-02-28 18:34:07,303 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2024-02-28 18:34:07,303 INFO  L138        SettingsManager]:  * Use SBE=true
[2024-02-28 18:34:07,303 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-02-28 18:34:07,304 INFO  L138        SettingsManager]:  * sizeof long=4
[2024-02-28 18:34:07,304 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2024-02-28 18:34:07,304 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-02-28 18:34:07,304 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2024-02-28 18:34:07,304 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2024-02-28 18:34:07,304 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-02-28 18:34:07,304 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-02-28 18:34:07,304 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-02-28 18:34:07,304 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-02-28 18:34:07,305 INFO  L138        SettingsManager]:  * sizeof long double=12
[2024-02-28 18:34:07,305 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2024-02-28 18:34:07,305 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2024-02-28 18:34:07,305 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-02-28 18:34:07,305 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-02-28 18:34:07,305 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-02-28 18:34:07,305 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-02-28 18:34:07,305 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-02-28 18:34:07,305 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-02-28 18:34:07,306 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-02-28 18:34:07,306 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-02-28 18:34:07,306 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-02-28 18:34:07,306 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-02-28 18:34:07,306 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-02-28 18:34:07,306 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-02-28 18:34:07,306 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-02-28 18:34:07,306 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-02-28 18:34:07,307 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2024-02-28 18:34:07,307 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 73a9ab851ce1c73d80f83f7e6335d12ad87baacd38ef2209152d18ccc2128259
[2024-02-28 18:34:07,470 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-02-28 18:34:07,510 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-02-28 18:34:07,513 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-02-28 18:34:07,514 INFO  L271        PluginConnector]: Initializing CDTParser...
[2024-02-28 18:34:07,514 INFO  L275        PluginConnector]: CDTParser initialized
[2024-02-28 18:34:07,515 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct.i
[2024-02-28 18:34:08,599 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2024-02-28 18:34:08,773 INFO  L351              CDTParser]: Found 1 translation units.
[2024-02-28 18:34:08,773 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct.i
[2024-02-28 18:34:08,783 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/e0d2c4440/06678e9069fa4fb3a96dda080a46d232/FLAGef7ae4e81
[2024-02-28 18:34:08,794 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/e0d2c4440/06678e9069fa4fb3a96dda080a46d232
[2024-02-28 18:34:08,796 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-02-28 18:34:08,797 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-02-28 18:34:08,798 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-02-28 18:34:08,798 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-02-28 18:34:08,801 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-02-28 18:34:08,801 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 06:34:08" (1/1) ...
[2024-02-28 18:34:08,802 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2decb9ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 06:34:08, skipping insertion in model container
[2024-02-28 18:34:08,802 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 06:34:08" (1/1) ...
[2024-02-28 18:34:08,807 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2024-02-28 18:34:08,838 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2024-02-28 18:34:08,951 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-02-28 18:34:09,092 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-02-28 18:34:09,099 INFO  L203         MainTranslator]: Completed pre-run
[2024-02-28 18:34:09,108 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-02-28 18:34:09,131 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-02-28 18:34:09,164 INFO  L208         MainTranslator]: Completed translation
[2024-02-28 18:34:09,164 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 06:34:09 WrapperNode
[2024-02-28 18:34:09,164 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-02-28 18:34:09,165 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-02-28 18:34:09,165 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-02-28 18:34:09,165 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2024-02-28 18:34:09,170 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 06:34:09" (1/1) ...
[2024-02-28 18:34:09,183 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 06:34:09" (1/1) ...
[2024-02-28 18:34:09,200 INFO  L138                Inliner]: procedures = 266, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 77
[2024-02-28 18:34:09,200 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-02-28 18:34:09,201 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-02-28 18:34:09,201 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2024-02-28 18:34:09,201 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2024-02-28 18:34:09,208 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 06:34:09" (1/1) ...
[2024-02-28 18:34:09,208 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 06:34:09" (1/1) ...
[2024-02-28 18:34:09,212 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 06:34:09" (1/1) ...
[2024-02-28 18:34:09,212 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 06:34:09" (1/1) ...
[2024-02-28 18:34:09,219 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 06:34:09" (1/1) ...
[2024-02-28 18:34:09,221 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 06:34:09" (1/1) ...
[2024-02-28 18:34:09,223 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 06:34:09" (1/1) ...
[2024-02-28 18:34:09,224 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 06:34:09" (1/1) ...
[2024-02-28 18:34:09,226 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-02-28 18:34:09,227 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-02-28 18:34:09,227 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2024-02-28 18:34:09,227 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2024-02-28 18:34:09,228 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 06:34:09" (1/1) ...
[2024-02-28 18:34:09,233 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-02-28 18:34:09,241 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 18:34:09,252 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2024-02-28 18:34:09,254 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2024-02-28 18:34:09,274 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-02-28 18:34:09,275 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-02-28 18:34:09,275 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-02-28 18:34:09,275 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-02-28 18:34:09,275 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-02-28 18:34:09,275 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-02-28 18:34:09,275 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-02-28 18:34:09,275 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-02-28 18:34:09,275 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-02-28 18:34:09,275 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-02-28 18:34:09,275 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-02-28 18:34:09,276 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2024-02-28 18:34:09,442 INFO  L235             CfgBuilder]: Building ICFG
[2024-02-28 18:34:09,444 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-02-28 18:34:09,630 INFO  L276             CfgBuilder]: Performing block encoding
[2024-02-28 18:34:09,635 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-02-28 18:34:09,636 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2024-02-28 18:34:09,637 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 06:34:09 BoogieIcfgContainer
[2024-02-28 18:34:09,637 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-02-28 18:34:09,639 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-02-28 18:34:09,639 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2024-02-28 18:34:09,641 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2024-02-28 18:34:09,641 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.02 06:34:08" (1/3) ...
[2024-02-28 18:34:09,642 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3efeb201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 06:34:09, skipping insertion in model container
[2024-02-28 18:34:09,642 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 06:34:09" (2/3) ...
[2024-02-28 18:34:09,642 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3efeb201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 06:34:09, skipping insertion in model container
[2024-02-28 18:34:09,642 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 06:34:09" (3/3) ...
[2024-02-28 18:34:09,643 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct.i
[2024-02-28 18:34:09,649 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-02-28 18:34:09,656 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-02-28 18:34:09,656 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations.
[2024-02-28 18:34:09,657 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-02-28 18:34:09,700 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-02-28 18:34:09,729 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 102 places, 103 transitions, 214 flow
[2024-02-28 18:34:09,778 INFO  L130       PetriNetUnfolder]: 6/152 cut-off events.
[2024-02-28 18:34:09,778 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-02-28 18:34:09,782 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 158 conditions, 152 events. 6/152 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 287 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 73. Up to 4 conditions per place. 
[2024-02-28 18:34:09,782 INFO  L82        GeneralOperation]: Start removeDead. Operand has 102 places, 103 transitions, 214 flow
[2024-02-28 18:34:09,785 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 102 places, 103 transitions, 214 flow
[2024-02-28 18:34:09,788 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-02-28 18:34:09,796 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 103 transitions, 214 flow
[2024-02-28 18:34:09,798 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 103 transitions, 214 flow
[2024-02-28 18:34:09,799 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 102 places, 103 transitions, 214 flow
[2024-02-28 18:34:09,823 INFO  L130       PetriNetUnfolder]: 6/152 cut-off events.
[2024-02-28 18:34:09,824 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-02-28 18:34:09,824 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 158 conditions, 152 events. 6/152 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 287 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 73. Up to 4 conditions per place. 
[2024-02-28 18:34:09,825 INFO  L119        LiptonReduction]: Number of co-enabled transitions 1792
[2024-02-28 18:34:11,360 INFO  L134        LiptonReduction]: Checked pairs total: 7802
[2024-02-28 18:34:11,360 INFO  L136        LiptonReduction]: Total number of compositions: 64
[2024-02-28 18:34:11,372 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 18:34:11,377 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@73dfc1e1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-02-28 18:34:11,378 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-02-28 18:34:11,381 INFO  L130       PetriNetUnfolder]: 0/18 cut-off events.
[2024-02-28 18:34:11,381 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-02-28 18:34:11,381 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:34:11,382 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:34:11,382 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-02-28 18:34:11,385 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:34:11,386 INFO  L85        PathProgramCache]: Analyzing trace with hash -600513933, now seen corresponding path program 1 times
[2024-02-28 18:34:11,392 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:34:11,392 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223449657]
[2024-02-28 18:34:11,392 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:34:11,393 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:34:11,483 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:34:11,598 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:34:11,599 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:34:11,599 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223449657]
[2024-02-28 18:34:11,600 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223449657] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 18:34:11,600 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 18:34:11,600 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-02-28 18:34:11,601 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852689505]
[2024-02-28 18:34:11,601 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 18:34:11,608 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-02-28 18:34:11,608 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:34:11,626 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-02-28 18:34:11,628 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-02-28 18:34:11,683 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 167
[2024-02-28 18:34:11,685 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 102 flow. Second operand  has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:11,685 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:34:11,685 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 167
[2024-02-28 18:34:11,686 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:34:11,758 INFO  L130       PetriNetUnfolder]: 24/218 cut-off events.
[2024-02-28 18:34:11,758 INFO  L131       PetriNetUnfolder]: For 4/4 co-relation queries the response was YES.
[2024-02-28 18:34:11,759 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 301 conditions, 218 events. 24/218 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 907 event pairs, 0 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 227. Up to 63 conditions per place. 
[2024-02-28 18:34:11,761 INFO  L137   encePairwiseOnDemand]: 163/167 looper letters, 19 selfloop transitions, 3 changer transitions 2/56 dead transitions.
[2024-02-28 18:34:11,761 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 56 transitions, 168 flow
[2024-02-28 18:34:11,762 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-02-28 18:34:11,764 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-02-28 18:34:11,770 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 393 transitions.
[2024-02-28 18:34:11,772 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5883233532934131
[2024-02-28 18:34:11,773 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 393 transitions.
[2024-02-28 18:34:11,773 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 393 transitions.
[2024-02-28 18:34:11,774 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:34:11,776 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 393 transitions.
[2024-02-28 18:34:11,780 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:11,786 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:11,786 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:11,788 INFO  L175             Difference]: Start difference. First operand has 49 places, 47 transitions, 102 flow. Second operand 4 states and 393 transitions.
[2024-02-28 18:34:11,789 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 56 transitions, 168 flow
[2024-02-28 18:34:11,791 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 56 transitions, 168 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 18:34:11,793 INFO  L231             Difference]: Finished difference. Result has 54 places, 48 transitions, 118 flow
[2024-02-28 18:34:11,795 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=54, PETRI_TRANSITIONS=48}
[2024-02-28 18:34:11,798 INFO  L288   CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places.
[2024-02-28 18:34:11,799 INFO  L495      AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 118 flow
[2024-02-28 18:34:11,799 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:11,799 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:34:11,799 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:34:11,799 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-02-28 18:34:11,799 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-02-28 18:34:11,800 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:34:11,800 INFO  L85        PathProgramCache]: Analyzing trace with hash -407873938, now seen corresponding path program 1 times
[2024-02-28 18:34:11,800 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:34:11,800 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405273647]
[2024-02-28 18:34:11,800 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:34:11,801 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:34:11,825 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:34:12,027 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:34:12,027 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:34:12,028 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405273647]
[2024-02-28 18:34:12,028 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405273647] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 18:34:12,028 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 18:34:12,028 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 18:34:12,028 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997180864]
[2024-02-28 18:34:12,028 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 18:34:12,029 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 18:34:12,029 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:34:12,030 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 18:34:12,030 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 18:34:12,186 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 73 out of 167
[2024-02-28 18:34:12,187 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 118 flow. Second operand  has 6 states, 6 states have (on average 74.33333333333333) internal successors, (446), 6 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:12,187 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:34:12,187 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 167
[2024-02-28 18:34:12,187 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:34:12,346 INFO  L130       PetriNetUnfolder]: 246/699 cut-off events.
[2024-02-28 18:34:12,347 INFO  L131       PetriNetUnfolder]: For 33/39 co-relation queries the response was YES.
[2024-02-28 18:34:12,348 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1349 conditions, 699 events. 246/699 cut-off events. For 33/39 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3888 event pairs, 51 based on Foata normal form. 1/673 useless extension candidates. Maximal degree in co-relation 1254. Up to 348 conditions per place. 
[2024-02-28 18:34:12,350 INFO  L137   encePairwiseOnDemand]: 144/167 looper letters, 64 selfloop transitions, 29 changer transitions 1/104 dead transitions.
[2024-02-28 18:34:12,351 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 104 transitions, 428 flow
[2024-02-28 18:34:12,351 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 18:34:12,351 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 18:34:12,353 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 534 transitions.
[2024-02-28 18:34:12,353 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5329341317365269
[2024-02-28 18:34:12,353 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 534 transitions.
[2024-02-28 18:34:12,354 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 534 transitions.
[2024-02-28 18:34:12,354 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:34:12,354 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 534 transitions.
[2024-02-28 18:34:12,355 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 89.0) internal successors, (534), 6 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:12,358 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:12,358 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:12,358 INFO  L175             Difference]: Start difference. First operand has 54 places, 48 transitions, 118 flow. Second operand 6 states and 534 transitions.
[2024-02-28 18:34:12,358 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 104 transitions, 428 flow
[2024-02-28 18:34:12,359 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 104 transitions, 425 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-02-28 18:34:12,361 INFO  L231             Difference]: Finished difference. Result has 63 places, 76 transitions, 330 flow
[2024-02-28 18:34:12,361 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=330, PETRI_PLACES=63, PETRI_TRANSITIONS=76}
[2024-02-28 18:34:12,362 INFO  L288   CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places.
[2024-02-28 18:34:12,362 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 76 transitions, 330 flow
[2024-02-28 18:34:12,362 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 74.33333333333333) internal successors, (446), 6 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:12,362 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:34:12,362 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:34:12,362 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-02-28 18:34:12,363 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-02-28 18:34:12,363 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:34:12,363 INFO  L85        PathProgramCache]: Analyzing trace with hash 525784661, now seen corresponding path program 1 times
[2024-02-28 18:34:12,363 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:34:12,364 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514216993]
[2024-02-28 18:34:12,364 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:34:12,364 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:34:12,381 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:34:12,570 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:34:12,570 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:34:12,570 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514216993]
[2024-02-28 18:34:12,570 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514216993] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 18:34:12,570 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 18:34:12,570 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 18:34:12,571 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256760155]
[2024-02-28 18:34:12,571 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 18:34:12,571 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 18:34:12,571 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:34:12,571 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 18:34:12,572 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 18:34:12,677 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 73 out of 167
[2024-02-28 18:34:12,678 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 76 transitions, 330 flow. Second operand  has 6 states, 6 states have (on average 75.33333333333333) internal successors, (452), 6 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:12,678 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:34:12,678 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 167
[2024-02-28 18:34:12,678 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:34:13,008 INFO  L130       PetriNetUnfolder]: 373/970 cut-off events.
[2024-02-28 18:34:13,008 INFO  L131       PetriNetUnfolder]: For 400/406 co-relation queries the response was YES.
[2024-02-28 18:34:13,010 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2641 conditions, 970 events. 373/970 cut-off events. For 400/406 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5726 event pairs, 93 based on Foata normal form. 0/912 useless extension candidates. Maximal degree in co-relation 2482. Up to 670 conditions per place. 
[2024-02-28 18:34:13,013 INFO  L137   encePairwiseOnDemand]: 145/167 looper letters, 83 selfloop transitions, 72 changer transitions 14/183 dead transitions.
[2024-02-28 18:34:13,013 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 183 transitions, 1068 flow
[2024-02-28 18:34:13,013 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 18:34:13,014 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 18:34:13,015 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 575 transitions.
[2024-02-28 18:34:13,015 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5738522954091816
[2024-02-28 18:34:13,015 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 575 transitions.
[2024-02-28 18:34:13,015 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 575 transitions.
[2024-02-28 18:34:13,016 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:34:13,016 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 575 transitions.
[2024-02-28 18:34:13,017 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:13,019 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:13,019 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:13,019 INFO  L175             Difference]: Start difference. First operand has 63 places, 76 transitions, 330 flow. Second operand 6 states and 575 transitions.
[2024-02-28 18:34:13,019 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 183 transitions, 1068 flow
[2024-02-28 18:34:13,024 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 183 transitions, 1052 flow, removed 5 selfloop flow, removed 2 redundant places.
[2024-02-28 18:34:13,026 INFO  L231             Difference]: Finished difference. Result has 69 places, 145 transitions, 864 flow
[2024-02-28 18:34:13,027 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=864, PETRI_PLACES=69, PETRI_TRANSITIONS=145}
[2024-02-28 18:34:13,027 INFO  L288   CegarLoopForPetriNet]: 49 programPoint places, 20 predicate places.
[2024-02-28 18:34:13,027 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 145 transitions, 864 flow
[2024-02-28 18:34:13,028 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 75.33333333333333) internal successors, (452), 6 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:13,028 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:34:13,028 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2024-02-28 18:34:13,028 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-02-28 18:34:13,028 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-02-28 18:34:13,028 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:34:13,029 INFO  L85        PathProgramCache]: Analyzing trace with hash 1168448851, now seen corresponding path program 1 times
[2024-02-28 18:34:13,029 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:34:13,029 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834299909]
[2024-02-28 18:34:13,029 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:34:13,029 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:34:13,055 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 18:34:13,055 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-28 18:34:13,066 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 18:34:13,082 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-28 18:34:13,082 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-02-28 18:34:13,083 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2024-02-28 18:34:13,085 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2024-02-28 18:34:13,085 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2024-02-28 18:34:13,085 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2024-02-28 18:34:13,085 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2024-02-28 18:34:13,085 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2024-02-28 18:34:13,086 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2024-02-28 18:34:13,086 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-02-28 18:34:13,086 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2024-02-28 18:34:13,088 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-02-28 18:34:13,088 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-02-28 18:34:13,104 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-02-28 18:34:13,107 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 121 transitions, 260 flow
[2024-02-28 18:34:13,125 INFO  L130       PetriNetUnfolder]: 11/269 cut-off events.
[2024-02-28 18:34:13,125 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-02-28 18:34:13,125 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 283 conditions, 269 events. 11/269 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 603 event pairs, 0 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 154. Up to 8 conditions per place. 
[2024-02-28 18:34:13,126 INFO  L82        GeneralOperation]: Start removeDead. Operand has 121 places, 121 transitions, 260 flow
[2024-02-28 18:34:13,126 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 121 places, 121 transitions, 260 flow
[2024-02-28 18:34:13,127 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-02-28 18:34:13,127 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 121 transitions, 260 flow
[2024-02-28 18:34:13,127 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 121 transitions, 260 flow
[2024-02-28 18:34:13,127 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 121 transitions, 260 flow
[2024-02-28 18:34:13,142 INFO  L130       PetriNetUnfolder]: 11/269 cut-off events.
[2024-02-28 18:34:13,142 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-02-28 18:34:13,143 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 283 conditions, 269 events. 11/269 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 603 event pairs, 0 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 154. Up to 8 conditions per place. 
[2024-02-28 18:34:13,145 INFO  L119        LiptonReduction]: Number of co-enabled transitions 4512
[2024-02-28 18:34:14,826 INFO  L134        LiptonReduction]: Checked pairs total: 20227
[2024-02-28 18:34:14,826 INFO  L136        LiptonReduction]: Total number of compositions: 72
[2024-02-28 18:34:14,827 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 18:34:14,828 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@73dfc1e1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-02-28 18:34:14,828 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-02-28 18:34:14,830 INFO  L130       PetriNetUnfolder]: 0/18 cut-off events.
[2024-02-28 18:34:14,830 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-02-28 18:34:14,830 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:34:14,830 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:34:14,830 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:34:14,830 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:34:14,830 INFO  L85        PathProgramCache]: Analyzing trace with hash 320509981, now seen corresponding path program 1 times
[2024-02-28 18:34:14,831 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:34:14,831 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292530290]
[2024-02-28 18:34:14,831 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:34:14,831 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:34:14,849 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:34:14,878 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:34:14,878 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:34:14,878 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292530290]
[2024-02-28 18:34:14,878 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292530290] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 18:34:14,878 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 18:34:14,878 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-02-28 18:34:14,879 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615903603]
[2024-02-28 18:34:14,879 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 18:34:14,879 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-02-28 18:34:14,879 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:34:14,879 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-02-28 18:34:14,879 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-02-28 18:34:14,921 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 108 out of 193
[2024-02-28 18:34:14,921 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 136 flow. Second operand  has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:14,921 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:34:14,921 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 193
[2024-02-28 18:34:14,922 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:34:15,078 INFO  L130       PetriNetUnfolder]: 406/1207 cut-off events.
[2024-02-28 18:34:15,078 INFO  L131       PetriNetUnfolder]: For 80/120 co-relation queries the response was YES.
[2024-02-28 18:34:15,079 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1972 conditions, 1207 events. 406/1207 cut-off events. For 80/120 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 7625 event pairs, 290 based on Foata normal form. 0/1076 useless extension candidates. Maximal degree in co-relation 650. Up to 713 conditions per place. 
[2024-02-28 18:34:15,083 INFO  L137   encePairwiseOnDemand]: 189/193 looper letters, 28 selfloop transitions, 3 changer transitions 2/70 dead transitions.
[2024-02-28 18:34:15,083 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 70 transitions, 224 flow
[2024-02-28 18:34:15,084 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-02-28 18:34:15,084 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-02-28 18:34:15,085 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 466 transitions.
[2024-02-28 18:34:15,085 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6036269430051814
[2024-02-28 18:34:15,085 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 466 transitions.
[2024-02-28 18:34:15,085 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 466 transitions.
[2024-02-28 18:34:15,085 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:34:15,085 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 466 transitions.
[2024-02-28 18:34:15,086 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:15,088 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:15,089 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:15,089 INFO  L175             Difference]: Start difference. First operand has 62 places, 59 transitions, 136 flow. Second operand 4 states and 466 transitions.
[2024-02-28 18:34:15,089 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 70 transitions, 224 flow
[2024-02-28 18:34:15,090 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 70 transitions, 224 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 18:34:15,090 INFO  L231             Difference]: Finished difference. Result has 67 places, 61 transitions, 156 flow
[2024-02-28 18:34:15,090 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=67, PETRI_TRANSITIONS=61}
[2024-02-28 18:34:15,092 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places.
[2024-02-28 18:34:15,092 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 156 flow
[2024-02-28 18:34:15,092 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:15,092 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:34:15,092 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:34:15,092 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-02-28 18:34:15,093 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:34:15,093 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:34:15,093 INFO  L85        PathProgramCache]: Analyzing trace with hash 684924882, now seen corresponding path program 1 times
[2024-02-28 18:34:15,093 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:34:15,093 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275959254]
[2024-02-28 18:34:15,093 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:34:15,093 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:34:15,103 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:34:15,229 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:34:15,229 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:34:15,229 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275959254]
[2024-02-28 18:34:15,229 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275959254] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 18:34:15,229 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 18:34:15,229 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 18:34:15,230 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288969574]
[2024-02-28 18:34:15,230 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 18:34:15,230 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 18:34:15,230 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:34:15,230 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 18:34:15,230 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 18:34:15,376 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 193
[2024-02-28 18:34:15,377 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 156 flow. Second operand  has 6 states, 6 states have (on average 86.33333333333333) internal successors, (518), 6 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:15,377 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:34:15,377 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 193
[2024-02-28 18:34:15,377 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:34:16,241 INFO  L130       PetriNetUnfolder]: 5476/10051 cut-off events.
[2024-02-28 18:34:16,241 INFO  L131       PetriNetUnfolder]: For 425/445 co-relation queries the response was YES.
[2024-02-28 18:34:16,249 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19612 conditions, 10051 events. 5476/10051 cut-off events. For 425/445 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 70071 event pairs, 1407 based on Foata normal form. 2/9766 useless extension candidates. Maximal degree in co-relation 19515. Up to 6033 conditions per place. 
[2024-02-28 18:34:16,279 INFO  L137   encePairwiseOnDemand]: 166/193 looper letters, 92 selfloop transitions, 48 changer transitions 1/154 dead transitions.
[2024-02-28 18:34:16,280 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 154 transitions, 644 flow
[2024-02-28 18:34:16,280 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 18:34:16,280 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 18:34:16,281 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 651 transitions.
[2024-02-28 18:34:16,282 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5621761658031088
[2024-02-28 18:34:16,282 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 651 transitions.
[2024-02-28 18:34:16,282 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 651 transitions.
[2024-02-28 18:34:16,282 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:34:16,282 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 651 transitions.
[2024-02-28 18:34:16,283 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:16,285 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:16,285 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:16,285 INFO  L175             Difference]: Start difference. First operand has 67 places, 61 transitions, 156 flow. Second operand 6 states and 651 transitions.
[2024-02-28 18:34:16,285 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 154 transitions, 644 flow
[2024-02-28 18:34:16,287 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 154 transitions, 641 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-02-28 18:34:16,288 INFO  L231             Difference]: Finished difference. Result has 76 places, 108 transitions, 490 flow
[2024-02-28 18:34:16,289 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=490, PETRI_PLACES=76, PETRI_TRANSITIONS=108}
[2024-02-28 18:34:16,289 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 14 predicate places.
[2024-02-28 18:34:16,289 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 108 transitions, 490 flow
[2024-02-28 18:34:16,290 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 86.33333333333333) internal successors, (518), 6 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:16,290 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:34:16,290 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:34:16,290 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-02-28 18:34:16,290 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:34:16,290 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:34:16,290 INFO  L85        PathProgramCache]: Analyzing trace with hash 853559299, now seen corresponding path program 1 times
[2024-02-28 18:34:16,290 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:34:16,290 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552477665]
[2024-02-28 18:34:16,291 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:34:16,291 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:34:16,302 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:34:16,461 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:34:16,462 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:34:16,462 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552477665]
[2024-02-28 18:34:16,462 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552477665] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 18:34:16,462 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 18:34:16,462 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 18:34:16,462 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991266636]
[2024-02-28 18:34:16,462 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 18:34:16,463 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 18:34:16,463 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:34:16,463 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 18:34:16,463 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 18:34:16,573 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 193
[2024-02-28 18:34:16,574 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 108 transitions, 490 flow. Second operand  has 6 states, 6 states have (on average 87.33333333333333) internal successors, (524), 6 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:16,574 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:34:16,574 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 193
[2024-02-28 18:34:16,574 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:34:17,894 INFO  L130       PetriNetUnfolder]: 9320/16178 cut-off events.
[2024-02-28 18:34:17,895 INFO  L131       PetriNetUnfolder]: For 8208/8322 co-relation queries the response was YES.
[2024-02-28 18:34:17,915 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44381 conditions, 16178 events. 9320/16178 cut-off events. For 8208/8322 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 114584 event pairs, 2813 based on Foata normal form. 0/15540 useless extension candidates. Maximal degree in co-relation 26087. Up to 11753 conditions per place. 
[2024-02-28 18:34:17,976 INFO  L137   encePairwiseOnDemand]: 166/193 looper letters, 150 selfloop transitions, 142 changer transitions 0/309 dead transitions.
[2024-02-28 18:34:17,976 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 309 transitions, 1906 flow
[2024-02-28 18:34:17,976 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 18:34:17,977 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 18:34:17,978 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 697 transitions.
[2024-02-28 18:34:17,978 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6018998272884283
[2024-02-28 18:34:17,978 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 697 transitions.
[2024-02-28 18:34:17,978 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 697 transitions.
[2024-02-28 18:34:17,979 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:34:17,979 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 697 transitions.
[2024-02-28 18:34:17,980 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:17,982 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:17,982 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:17,982 INFO  L175             Difference]: Start difference. First operand has 76 places, 108 transitions, 490 flow. Second operand 6 states and 697 transitions.
[2024-02-28 18:34:17,982 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 309 transitions, 1906 flow
[2024-02-28 18:34:17,998 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 309 transitions, 1896 flow, removed 5 selfloop flow, removed 1 redundant places.
[2024-02-28 18:34:18,001 INFO  L231             Difference]: Finished difference. Result has 84 places, 245 transitions, 1786 flow
[2024-02-28 18:34:18,002 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1786, PETRI_PLACES=84, PETRI_TRANSITIONS=245}
[2024-02-28 18:34:18,002 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 22 predicate places.
[2024-02-28 18:34:18,002 INFO  L495      AbstractCegarLoop]: Abstraction has has 84 places, 245 transitions, 1786 flow
[2024-02-28 18:34:18,003 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 87.33333333333333) internal successors, (524), 6 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:18,003 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:34:18,003 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:34:18,003 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-02-28 18:34:18,003 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:34:18,003 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:34:18,003 INFO  L85        PathProgramCache]: Analyzing trace with hash 2054895432, now seen corresponding path program 1 times
[2024-02-28 18:34:18,003 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:34:18,004 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251218725]
[2024-02-28 18:34:18,004 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:34:18,004 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:34:18,020 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:34:18,367 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:34:18,367 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:34:18,367 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251218725]
[2024-02-28 18:34:18,368 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251218725] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 18:34:18,368 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831516211]
[2024-02-28 18:34:18,368 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:34:18,368 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:34:18,368 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 18:34:18,371 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 18:34:18,372 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-02-28 18:34:18,458 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:34:18,460 INFO  L263         TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 23 conjunts are in the unsatisfiable core
[2024-02-28 18:34:18,477 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 18:34:18,585 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 18:34:18,610 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-02-28 18:34:18,645 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:34:18,645 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-02-28 18:34:18,684 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:34:18,685 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-02-28 18:34:18,731 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:34:18,732 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 18:34:18,741 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:34:18,741 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 18:34:18,846 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_246 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_246) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_246 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_246) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_246 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_246) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_246 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_246) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-02-28 18:34:18,959 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:34:18,959 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831516211] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 18:34:18,959 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 18:34:18,959 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22
[2024-02-28 18:34:18,959 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590659944]
[2024-02-28 18:34:18,960 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 18:34:18,960 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2024-02-28 18:34:18,960 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:34:18,960 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2024-02-28 18:34:18,961 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=412, Unknown=6, NotChecked=42, Total=552
[2024-02-28 18:34:19,136 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 193
[2024-02-28 18:34:19,137 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 245 transitions, 1786 flow. Second operand  has 24 states, 24 states have (on average 59.208333333333336) internal successors, (1421), 24 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:19,137 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:34:19,137 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 193
[2024-02-28 18:34:19,137 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:34:23,856 INFO  L130       PetriNetUnfolder]: 15201/25123 cut-off events.
[2024-02-28 18:34:23,856 INFO  L131       PetriNetUnfolder]: For 32286/32302 co-relation queries the response was YES.
[2024-02-28 18:34:23,908 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 91549 conditions, 25123 events. 15201/25123 cut-off events. For 32286/32302 co-relation queries the response was YES. Maximal size of possible extension queue 787. Compared 176049 event pairs, 2473 based on Foata normal form. 444/24147 useless extension candidates. Maximal degree in co-relation 76139. Up to 10732 conditions per place. 
[2024-02-28 18:34:24,089 INFO  L137   encePairwiseOnDemand]: 142/193 looper letters, 792 selfloop transitions, 383 changer transitions 21/1201 dead transitions.
[2024-02-28 18:34:24,089 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 1201 transitions, 9892 flow
[2024-02-28 18:34:24,091 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2024-02-28 18:34:24,091 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2024-02-28 18:34:24,094 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1626 transitions.
[2024-02-28 18:34:24,095 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4680483592400691
[2024-02-28 18:34:24,095 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1626 transitions.
[2024-02-28 18:34:24,095 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1626 transitions.
[2024-02-28 18:34:24,096 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:34:24,096 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1626 transitions.
[2024-02-28 18:34:24,100 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 19 states, 18 states have (on average 90.33333333333333) internal successors, (1626), 18 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:24,104 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 19 states, 19 states have (on average 193.0) internal successors, (3667), 19 states have internal predecessors, (3667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:24,104 INFO  L81            ComplementDD]: Finished complementDD. Result  has 19 states, 19 states have (on average 193.0) internal successors, (3667), 19 states have internal predecessors, (3667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:24,104 INFO  L175             Difference]: Start difference. First operand has 84 places, 245 transitions, 1786 flow. Second operand 18 states and 1626 transitions.
[2024-02-28 18:34:24,104 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 1201 transitions, 9892 flow
[2024-02-28 18:34:24,436 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 1201 transitions, 9766 flow, removed 63 selfloop flow, removed 0 redundant places.
[2024-02-28 18:34:24,445 INFO  L231             Difference]: Finished difference. Result has 115 places, 617 transitions, 6070 flow
[2024-02-28 18:34:24,446 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=1732, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6070, PETRI_PLACES=115, PETRI_TRANSITIONS=617}
[2024-02-28 18:34:24,446 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 53 predicate places.
[2024-02-28 18:34:24,446 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 617 transitions, 6070 flow
[2024-02-28 18:34:24,447 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 24 states have (on average 59.208333333333336) internal successors, (1421), 24 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:24,447 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:34:24,447 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:34:24,455 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-02-28 18:34:24,648 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:34:24,649 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:34:24,650 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:34:24,650 INFO  L85        PathProgramCache]: Analyzing trace with hash -1888961290, now seen corresponding path program 1 times
[2024-02-28 18:34:24,650 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:34:24,654 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650805122]
[2024-02-28 18:34:24,654 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:34:24,655 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:34:24,679 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:34:24,974 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:34:24,974 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:34:24,974 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650805122]
[2024-02-28 18:34:24,974 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650805122] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 18:34:24,974 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038320256]
[2024-02-28 18:34:24,974 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:34:24,974 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:34:24,975 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 18:34:24,977 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 18:34:24,982 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-02-28 18:34:25,095 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:34:25,096 INFO  L263         TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 25 conjunts are in the unsatisfiable core
[2024-02-28 18:34:25,099 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 18:34:25,220 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 18:34:25,258 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:34:25,260 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-02-28 18:34:25,298 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:34:25,299 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:34:25,300 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-02-28 18:34:25,342 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:34:25,343 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:34:25,343 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:34:25,345 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-02-28 18:34:25,391 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:34:25,392 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 18:34:25,422 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:34:25,422 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 18:34:25,539 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0))))) is different from false
[2024-02-28 18:34:25,557 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0))))) is different from false
[2024-02-28 18:34:25,655 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2024-02-28 18:34:25,656 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038320256] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 18:34:25,656 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 18:34:25,656 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24
[2024-02-28 18:34:25,656 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115805889]
[2024-02-28 18:34:25,656 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 18:34:25,656 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-02-28 18:34:25,656 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:34:25,657 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-02-28 18:34:25,657 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=445, Unknown=15, NotChecked=90, Total=650
[2024-02-28 18:34:25,817 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 62 out of 193
[2024-02-28 18:34:25,818 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 617 transitions, 6070 flow. Second operand  has 26 states, 26 states have (on average 64.0) internal successors, (1664), 26 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:25,818 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:34:25,819 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 193
[2024-02-28 18:34:25,819 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:34:31,808 INFO  L130       PetriNetUnfolder]: 18975/31328 cut-off events.
[2024-02-28 18:34:31,808 INFO  L131       PetriNetUnfolder]: For 112088/112120 co-relation queries the response was YES.
[2024-02-28 18:34:31,895 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 158373 conditions, 31328 events. 18975/31328 cut-off events. For 112088/112120 co-relation queries the response was YES. Maximal size of possible extension queue 1027. Compared 226175 event pairs, 2318 based on Foata normal form. 488/29980 useless extension candidates. Maximal degree in co-relation 146765. Up to 12748 conditions per place. 
[2024-02-28 18:34:32,018 INFO  L137   encePairwiseOnDemand]: 166/193 looper letters, 836 selfloop transitions, 460 changer transitions 6/1307 dead transitions.
[2024-02-28 18:34:32,018 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 1307 transitions, 14709 flow
[2024-02-28 18:34:32,018 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-02-28 18:34:32,019 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-02-28 18:34:32,020 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 998 transitions.
[2024-02-28 18:34:32,021 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4309153713298791
[2024-02-28 18:34:32,021 INFO  L72            ComplementDD]: Start complementDD. Operand 12 states and 998 transitions.
[2024-02-28 18:34:32,021 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 998 transitions.
[2024-02-28 18:34:32,021 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:34:32,022 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 998 transitions.
[2024-02-28 18:34:32,023 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 13 states, 12 states have (on average 83.16666666666667) internal successors, (998), 12 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:32,026 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 13 states, 13 states have (on average 193.0) internal successors, (2509), 13 states have internal predecessors, (2509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:32,026 INFO  L81            ComplementDD]: Finished complementDD. Result  has 13 states, 13 states have (on average 193.0) internal successors, (2509), 13 states have internal predecessors, (2509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:32,026 INFO  L175             Difference]: Start difference. First operand has 115 places, 617 transitions, 6070 flow. Second operand 12 states and 998 transitions.
[2024-02-28 18:34:32,026 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 1307 transitions, 14709 flow
[2024-02-28 18:34:35,240 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 1307 transitions, 14552 flow, removed 77 selfloop flow, removed 1 redundant places.
[2024-02-28 18:34:35,254 INFO  L231             Difference]: Finished difference. Result has 132 places, 896 transitions, 10798 flow
[2024-02-28 18:34:35,254 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=6008, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=225, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=10798, PETRI_PLACES=132, PETRI_TRANSITIONS=896}
[2024-02-28 18:34:35,255 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 70 predicate places.
[2024-02-28 18:34:35,255 INFO  L495      AbstractCegarLoop]: Abstraction has has 132 places, 896 transitions, 10798 flow
[2024-02-28 18:34:35,256 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 64.0) internal successors, (1664), 26 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:35,256 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:34:35,256 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:34:35,265 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-02-28 18:34:35,456 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:34:35,457 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:34:35,457 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:34:35,458 INFO  L85        PathProgramCache]: Analyzing trace with hash -1965125181, now seen corresponding path program 1 times
[2024-02-28 18:34:35,458 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:34:35,458 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727834331]
[2024-02-28 18:34:35,458 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:34:35,458 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:34:35,482 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:34:35,660 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 18:34:35,661 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:34:35,661 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727834331]
[2024-02-28 18:34:35,661 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727834331] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 18:34:35,661 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 18:34:35,661 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 18:34:35,661 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517649121]
[2024-02-28 18:34:35,661 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 18:34:35,661 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 18:34:35,661 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:34:35,662 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 18:34:35,662 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 18:34:35,929 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 193
[2024-02-28 18:34:35,930 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 896 transitions, 10798 flow. Second operand  has 6 states, 6 states have (on average 97.0) internal successors, (582), 6 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:35,930 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:34:35,930 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 193
[2024-02-28 18:34:35,930 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:34:41,201 INFO  L130       PetriNetUnfolder]: 16418/28625 cut-off events.
[2024-02-28 18:34:41,201 INFO  L131       PetriNetUnfolder]: For 155479/157778 co-relation queries the response was YES.
[2024-02-28 18:34:41,296 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 156092 conditions, 28625 events. 16418/28625 cut-off events. For 155479/157778 co-relation queries the response was YES. Maximal size of possible extension queue 1047. Compared 222329 event pairs, 2783 based on Foata normal form. 233/27907 useless extension candidates. Maximal degree in co-relation 148341. Up to 18865 conditions per place. 
[2024-02-28 18:34:41,404 INFO  L137   encePairwiseOnDemand]: 178/193 looper letters, 669 selfloop transitions, 214 changer transitions 14/1152 dead transitions.
[2024-02-28 18:34:41,404 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 1152 transitions, 15581 flow
[2024-02-28 18:34:41,405 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 18:34:41,405 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 18:34:41,406 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 669 transitions.
[2024-02-28 18:34:41,406 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5777202072538861
[2024-02-28 18:34:41,407 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 669 transitions.
[2024-02-28 18:34:41,407 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 669 transitions.
[2024-02-28 18:34:41,407 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:34:41,407 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 669 transitions.
[2024-02-28 18:34:41,408 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:41,409 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:41,409 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:41,410 INFO  L175             Difference]: Start difference. First operand has 132 places, 896 transitions, 10798 flow. Second operand 6 states and 669 transitions.
[2024-02-28 18:34:41,410 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 1152 transitions, 15581 flow
[2024-02-28 18:34:44,087 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 1152 transitions, 15559 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-02-28 18:34:44,100 INFO  L231             Difference]: Finished difference. Result has 139 places, 1087 transitions, 14274 flow
[2024-02-28 18:34:44,101 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=10776, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=896, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=799, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=14274, PETRI_PLACES=139, PETRI_TRANSITIONS=1087}
[2024-02-28 18:34:44,101 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 77 predicate places.
[2024-02-28 18:34:44,102 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 1087 transitions, 14274 flow
[2024-02-28 18:34:44,102 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 97.0) internal successors, (582), 6 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:44,102 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:34:44,102 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:34:44,102 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-02-28 18:34:44,102 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:34:44,102 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:34:44,102 INFO  L85        PathProgramCache]: Analyzing trace with hash 1935419539, now seen corresponding path program 1 times
[2024-02-28 18:34:44,102 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:34:44,103 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959269881]
[2024-02-28 18:34:44,103 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:34:44,103 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:34:44,125 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:34:44,281 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2024-02-28 18:34:44,281 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:34:44,281 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959269881]
[2024-02-28 18:34:44,281 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959269881] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 18:34:44,281 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 18:34:44,281 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 18:34:44,281 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286556782]
[2024-02-28 18:34:44,281 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 18:34:44,282 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 18:34:44,282 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:34:44,282 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 18:34:44,282 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 18:34:44,392 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 193
[2024-02-28 18:34:44,393 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 1087 transitions, 14274 flow. Second operand  has 6 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:44,393 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:34:44,393 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 193
[2024-02-28 18:34:44,393 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:34:52,457 INFO  L130       PetriNetUnfolder]: 21716/37020 cut-off events.
[2024-02-28 18:34:52,458 INFO  L131       PetriNetUnfolder]: For 214832/216490 co-relation queries the response was YES.
[2024-02-28 18:34:52,643 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 215547 conditions, 37020 events. 21716/37020 cut-off events. For 214832/216490 co-relation queries the response was YES. Maximal size of possible extension queue 1260. Compared 288881 event pairs, 2980 based on Foata normal form. 108/35388 useless extension candidates. Maximal degree in co-relation 205724. Up to 28521 conditions per place. 
[2024-02-28 18:34:52,787 INFO  L137   encePairwiseOnDemand]: 166/193 looper letters, 1054 selfloop transitions, 542 changer transitions 59/1699 dead transitions.
[2024-02-28 18:34:52,787 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 1699 transitions, 24290 flow
[2024-02-28 18:34:52,788 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 18:34:52,788 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 18:34:52,789 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 693 transitions.
[2024-02-28 18:34:52,790 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5984455958549223
[2024-02-28 18:34:52,790 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 693 transitions.
[2024-02-28 18:34:52,790 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 693 transitions.
[2024-02-28 18:34:52,790 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:34:52,790 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 693 transitions.
[2024-02-28 18:34:52,791 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:52,793 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:52,793 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:52,793 INFO  L175             Difference]: Start difference. First operand has 139 places, 1087 transitions, 14274 flow. Second operand 6 states and 693 transitions.
[2024-02-28 18:34:52,793 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 1699 transitions, 24290 flow
[2024-02-28 18:34:57,872 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 1699 transitions, 24074 flow, removed 108 selfloop flow, removed 0 redundant places.
[2024-02-28 18:34:57,893 INFO  L231             Difference]: Finished difference. Result has 149 places, 1540 transitions, 22206 flow
[2024-02-28 18:34:57,893 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=14166, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1087, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=698, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=22206, PETRI_PLACES=149, PETRI_TRANSITIONS=1540}
[2024-02-28 18:34:57,894 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 87 predicate places.
[2024-02-28 18:34:57,894 INFO  L495      AbstractCegarLoop]: Abstraction has has 149 places, 1540 transitions, 22206 flow
[2024-02-28 18:34:57,894 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:57,894 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:34:57,894 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:34:57,894 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-02-28 18:34:57,894 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:34:57,895 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:34:57,895 INFO  L85        PathProgramCache]: Analyzing trace with hash -1530475742, now seen corresponding path program 1 times
[2024-02-28 18:34:57,895 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:34:57,895 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037705369]
[2024-02-28 18:34:57,895 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:34:57,895 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:34:57,908 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:34:57,960 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:34:57,961 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:34:57,961 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037705369]
[2024-02-28 18:34:57,961 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037705369] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 18:34:57,961 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446426748]
[2024-02-28 18:34:57,961 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:34:57,961 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:34:57,961 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 18:34:57,962 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 18:34:57,964 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-02-28 18:34:58,066 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:34:58,067 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-02-28 18:34:58,068 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 18:34:58,103 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:34:58,104 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 18:34:58,146 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:34:58,146 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [446426748] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 18:34:58,146 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 18:34:58,146 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2024-02-28 18:34:58,146 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080579491]
[2024-02-28 18:34:58,146 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 18:34:58,147 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-02-28 18:34:58,147 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:34:58,147 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-02-28 18:34:58,147 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-02-28 18:34:58,213 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 193
[2024-02-28 18:34:58,214 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 1540 transitions, 22206 flow. Second operand  has 9 states, 9 states have (on average 106.22222222222223) internal successors, (956), 9 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:58,214 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:34:58,214 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 193
[2024-02-28 18:34:58,214 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:35:03,876 INFO  L130       PetriNetUnfolder]: 14368/25966 cut-off events.
[2024-02-28 18:35:03,876 INFO  L131       PetriNetUnfolder]: For 188753/190826 co-relation queries the response was YES.
[2024-02-28 18:35:03,998 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 156699 conditions, 25966 events. 14368/25966 cut-off events. For 188753/190826 co-relation queries the response was YES. Maximal size of possible extension queue 872. Compared 206381 event pairs, 1525 based on Foata normal form. 242/25853 useless extension candidates. Maximal degree in co-relation 151433. Up to 9439 conditions per place. 
[2024-02-28 18:35:04,101 INFO  L137   encePairwiseOnDemand]: 186/193 looper letters, 295 selfloop transitions, 8 changer transitions 39/1452 dead transitions.
[2024-02-28 18:35:04,102 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 1452 transitions, 21652 flow
[2024-02-28 18:35:04,103 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-02-28 18:35:04,103 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-02-28 18:35:04,104 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 778 transitions.
[2024-02-28 18:35:04,104 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5758697261287935
[2024-02-28 18:35:04,104 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 778 transitions.
[2024-02-28 18:35:04,105 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 778 transitions.
[2024-02-28 18:35:04,105 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:35:04,105 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 778 transitions.
[2024-02-28 18:35:04,106 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:35:04,108 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:35:04,108 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:35:04,108 INFO  L175             Difference]: Start difference. First operand has 149 places, 1540 transitions, 22206 flow. Second operand 7 states and 778 transitions.
[2024-02-28 18:35:04,108 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 1452 transitions, 21652 flow
[2024-02-28 18:35:07,459 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 1452 transitions, 21220 flow, removed 210 selfloop flow, removed 1 redundant places.
[2024-02-28 18:35:07,479 INFO  L231             Difference]: Finished difference. Result has 156 places, 1286 transitions, 18278 flow
[2024-02-28 18:35:07,480 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=18679, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=18278, PETRI_PLACES=156, PETRI_TRANSITIONS=1286}
[2024-02-28 18:35:07,480 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 94 predicate places.
[2024-02-28 18:35:07,480 INFO  L495      AbstractCegarLoop]: Abstraction has has 156 places, 1286 transitions, 18278 flow
[2024-02-28 18:35:07,481 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 106.22222222222223) internal successors, (956), 9 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:35:07,481 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:35:07,481 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:35:07,488 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2024-02-28 18:35:07,682 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2024-02-28 18:35:07,682 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:35:07,683 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:35:07,683 INFO  L85        PathProgramCache]: Analyzing trace with hash 860108621, now seen corresponding path program 1 times
[2024-02-28 18:35:07,683 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:35:07,684 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752627573]
[2024-02-28 18:35:07,684 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:35:07,684 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:35:07,714 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:35:08,239 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:35:08,239 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:35:08,239 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752627573]
[2024-02-28 18:35:08,239 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752627573] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 18:35:08,239 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161027916]
[2024-02-28 18:35:08,239 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:35:08,240 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:35:08,240 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 18:35:08,240 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 18:35:08,243 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-02-28 18:35:08,364 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:35:08,365 INFO  L263         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 45 conjunts are in the unsatisfiable core
[2024-02-28 18:35:08,369 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 18:35:08,393 INFO  L321             Elim1Store]: treesize reduction 23, result has 17.9 percent of original size
[2024-02-28 18:35:08,394 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26
[2024-02-28 18:35:08,441 INFO  L321             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2024-02-28 18:35:08,442 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2024-02-28 18:35:08,517 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-02-28 18:35:08,517 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28
[2024-02-28 18:35:08,552 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2024-02-28 18:35:08,592 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 18:35:08,629 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-02-28 18:35:08,681 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:35:08,681 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-02-28 18:35:08,752 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:35:08,752 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-02-28 18:35:08,839 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-02-28 18:35:08,892 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 18:35:08,922 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 18:35:08,957 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 18:35:08,994 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 18:35:09,045 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 18:35:09,056 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:35:09,056 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 18:35:09,079 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_619 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_619 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_619 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_619 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2024-02-28 18:35:09,328 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse0 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse0 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse0 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse0 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false
[2024-02-28 18:35:09,374 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse1 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse1 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse1 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse1 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-02-28 18:35:09,408 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse1 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse1 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse1 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse1 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) .cse3)))))) is different from false
[2024-02-28 18:35:09,622 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-02-28 18:35:09,622 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161027916] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 18:35:09,622 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 18:35:09,623 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 30
[2024-02-28 18:35:09,623 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013708336]
[2024-02-28 18:35:09,623 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 18:35:09,624 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2024-02-28 18:35:09,624 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:35:09,624 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2024-02-28 18:35:09,625 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=625, Unknown=28, NotChecked=220, Total=992
[2024-02-28 18:35:09,644 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 52 out of 193
[2024-02-28 18:35:09,646 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 1286 transitions, 18278 flow. Second operand  has 32 states, 32 states have (on average 54.21875) internal successors, (1735), 32 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:35:09,646 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:35:09,646 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 193
[2024-02-28 18:35:09,646 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:35:24,319 INFO  L130       PetriNetUnfolder]: 20754/34185 cut-off events.
[2024-02-28 18:35:24,319 INFO  L131       PetriNetUnfolder]: For 249847/249847 co-relation queries the response was YES.
[2024-02-28 18:35:24,506 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 222240 conditions, 34185 events. 20754/34185 cut-off events. For 249847/249847 co-relation queries the response was YES. Maximal size of possible extension queue 990. Compared 246789 event pairs, 2245 based on Foata normal form. 10/34195 useless extension candidates. Maximal degree in co-relation 210820. Up to 29454 conditions per place. 
[2024-02-28 18:35:24,645 INFO  L137   encePairwiseOnDemand]: 146/193 looper letters, 1498 selfloop transitions, 379 changer transitions 37/1916 dead transitions.
[2024-02-28 18:35:24,646 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 1916 transitions, 29258 flow
[2024-02-28 18:35:24,646 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2024-02-28 18:35:24,647 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2024-02-28 18:35:24,649 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1484 transitions.
[2024-02-28 18:35:24,649 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3495054168629298
[2024-02-28 18:35:24,650 INFO  L72            ComplementDD]: Start complementDD. Operand 22 states and 1484 transitions.
[2024-02-28 18:35:24,650 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 22 states and 1484 transitions.
[2024-02-28 18:35:24,650 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:35:24,650 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1484 transitions.
[2024-02-28 18:35:24,653 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 23 states, 22 states have (on average 67.45454545454545) internal successors, (1484), 22 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:35:24,657 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 23 states, 23 states have (on average 193.0) internal successors, (4439), 23 states have internal predecessors, (4439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:35:24,657 INFO  L81            ComplementDD]: Finished complementDD. Result  has 23 states, 23 states have (on average 193.0) internal successors, (4439), 23 states have internal predecessors, (4439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:35:24,658 INFO  L175             Difference]: Start difference. First operand has 156 places, 1286 transitions, 18278 flow. Second operand 22 states and 1484 transitions.
[2024-02-28 18:35:24,658 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 1916 transitions, 29258 flow
[2024-02-28 18:35:28,989 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 1916 transitions, 29237 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-02-28 18:35:29,016 INFO  L231             Difference]: Finished difference. Result has 184 places, 1574 transitions, 23573 flow
[2024-02-28 18:35:29,017 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=18268, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1014, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=23573, PETRI_PLACES=184, PETRI_TRANSITIONS=1574}
[2024-02-28 18:35:29,017 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 122 predicate places.
[2024-02-28 18:35:29,017 INFO  L495      AbstractCegarLoop]: Abstraction has has 184 places, 1574 transitions, 23573 flow
[2024-02-28 18:35:29,018 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 32 states have (on average 54.21875) internal successors, (1735), 32 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:35:29,018 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:35:29,018 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:35:29,022 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-02-28 18:35:29,223 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:35:29,223 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:35:29,223 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:35:29,224 INFO  L85        PathProgramCache]: Analyzing trace with hash 103820759, now seen corresponding path program 2 times
[2024-02-28 18:35:29,224 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:35:29,224 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957555156]
[2024-02-28 18:35:29,224 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:35:29,224 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:35:29,247 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:35:29,788 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:35:29,788 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:35:29,789 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957555156]
[2024-02-28 18:35:29,789 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957555156] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 18:35:29,789 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166164472]
[2024-02-28 18:35:29,789 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-02-28 18:35:29,790 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:35:29,790 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 18:35:29,791 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 18:35:29,793 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-02-28 18:35:29,889 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-02-28 18:35:29,890 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 18:35:29,891 INFO  L263         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 42 conjunts are in the unsatisfiable core
[2024-02-28 18:35:29,896 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 18:35:29,903 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:35:29,903 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15
[2024-02-28 18:35:29,949 INFO  L321             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-02-28 18:35:29,950 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-02-28 18:35:30,060 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-02-28 18:35:30,061 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2024-02-28 18:35:30,108 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:35:30,109 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2024-02-28 18:35:30,149 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 18:35:30,194 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-02-28 18:35:30,253 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:35:30,254 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-02-28 18:35:30,387 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-02-28 18:35:30,440 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:35:30,440 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-02-28 18:35:30,507 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:35:30,508 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 18:35:30,539 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:35:30,540 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 18:35:30,566 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:35:30,568 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 18:35:30,597 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:35:30,598 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 18:35:30,641 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 18:35:30,656 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:35:30,656 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 18:35:30,805 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2024-02-28 18:35:30,871 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2024-02-28 18:35:30,892 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) .cse1 v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) .cse1 v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) .cse1 v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) .cse1 v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-02-28 18:35:30,963 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) .cse1 v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) .cse1 v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) .cse1 v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) .cse1 v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-02-28 18:35:31,227 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-02-28 18:35:31,227 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166164472] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 18:35:31,227 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 18:35:31,227 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 31
[2024-02-28 18:35:31,228 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645808328]
[2024-02-28 18:35:31,228 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 18:35:31,228 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2024-02-28 18:35:31,229 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:35:31,229 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2024-02-28 18:35:31,230 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=692, Unknown=20, NotChecked=228, Total=1056
[2024-02-28 18:35:31,487 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 52 out of 193
[2024-02-28 18:35:31,489 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 1574 transitions, 23573 flow. Second operand  has 33 states, 33 states have (on average 54.15151515151515) internal successors, (1787), 33 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:35:31,489 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:35:31,489 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 193
[2024-02-28 18:35:31,489 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:35:49,258 INFO  L130       PetriNetUnfolder]: 22025/36230 cut-off events.
[2024-02-28 18:35:49,258 INFO  L131       PetriNetUnfolder]: For 318170/318170 co-relation queries the response was YES.
[2024-02-28 18:35:49,564 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 255690 conditions, 36230 events. 22025/36230 cut-off events. For 318170/318170 co-relation queries the response was YES. Maximal size of possible extension queue 1005. Compared 262686 event pairs, 2277 based on Foata normal form. 48/36278 useless extension candidates. Maximal degree in co-relation 255398. Up to 29436 conditions per place. 
[2024-02-28 18:35:49,711 INFO  L137   encePairwiseOnDemand]: 152/193 looper letters, 1654 selfloop transitions, 654 changer transitions 10/2320 dead transitions.
[2024-02-28 18:35:49,711 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 2320 transitions, 38009 flow
[2024-02-28 18:35:49,712 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2024-02-28 18:35:49,712 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2024-02-28 18:35:49,714 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1745 transitions.
[2024-02-28 18:35:49,715 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3477481068154643
[2024-02-28 18:35:49,715 INFO  L72            ComplementDD]: Start complementDD. Operand 26 states and 1745 transitions.
[2024-02-28 18:35:49,715 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 1745 transitions.
[2024-02-28 18:35:49,716 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:35:49,716 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1745 transitions.
[2024-02-28 18:35:49,718 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 27 states, 26 states have (on average 67.11538461538461) internal successors, (1745), 26 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:35:49,723 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 27 states, 27 states have (on average 193.0) internal successors, (5211), 27 states have internal predecessors, (5211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:35:49,723 INFO  L81            ComplementDD]: Finished complementDD. Result  has 27 states, 27 states have (on average 193.0) internal successors, (5211), 27 states have internal predecessors, (5211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:35:49,723 INFO  L175             Difference]: Start difference. First operand has 184 places, 1574 transitions, 23573 flow. Second operand 26 states and 1745 transitions.
[2024-02-28 18:35:49,723 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 2320 transitions, 38009 flow
[2024-02-28 18:35:55,951 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 2320 transitions, 37529 flow, removed 238 selfloop flow, removed 3 redundant places.
[2024-02-28 18:35:55,982 INFO  L231             Difference]: Finished difference. Result has 219 places, 1900 transitions, 31113 flow
[2024-02-28 18:35:55,983 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=23363, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=356, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1063, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=31113, PETRI_PLACES=219, PETRI_TRANSITIONS=1900}
[2024-02-28 18:35:55,983 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 157 predicate places.
[2024-02-28 18:35:55,984 INFO  L495      AbstractCegarLoop]: Abstraction has has 219 places, 1900 transitions, 31113 flow
[2024-02-28 18:35:55,984 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 33 states, 33 states have (on average 54.15151515151515) internal successors, (1787), 33 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:35:55,984 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:35:55,984 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:35:55,990 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2024-02-28 18:35:56,185 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2024-02-28 18:35:56,186 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:35:56,186 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:35:56,186 INFO  L85        PathProgramCache]: Analyzing trace with hash 696920881, now seen corresponding path program 3 times
[2024-02-28 18:35:56,187 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:35:56,187 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895623757]
[2024-02-28 18:35:56,187 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:35:56,187 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:35:56,209 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:35:56,658 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:35:56,659 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:35:56,659 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895623757]
[2024-02-28 18:35:56,659 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895623757] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 18:35:56,659 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46711115]
[2024-02-28 18:35:56,659 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-02-28 18:35:56,659 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:35:56,660 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 18:35:56,661 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 18:35:56,661 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-02-28 18:35:56,791 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-02-28 18:35:56,791 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 18:35:56,793 INFO  L263         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 48 conjunts are in the unsatisfiable core
[2024-02-28 18:35:56,796 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 18:35:56,813 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:35:56,814 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15
[2024-02-28 18:35:56,861 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:35:56,874 INFO  L321             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2024-02-28 18:35:56,874 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2024-02-28 18:35:57,019 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-02-28 18:35:57,019 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2024-02-28 18:35:57,090 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2024-02-28 18:35:57,177 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-02-28 18:35:57,197 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 18:35:57,206 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-02-28 18:35:57,226 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:35:57,226 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-02-28 18:35:57,246 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:35:57,246 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-02-28 18:35:57,268 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 18:35:57,281 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:35:57,281 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 18:35:57,309 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_830) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_830) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_830) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_830) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) is different from false
[2024-02-28 18:35:57,458 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_830) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_830) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_830) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_830) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2024-02-28 18:35:57,855 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:35:57,856 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [46711115] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 18:35:57,856 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 18:35:57,856 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 29
[2024-02-28 18:35:57,856 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974037066]
[2024-02-28 18:35:57,856 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 18:35:57,857 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 31 states
[2024-02-28 18:35:57,857 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:35:57,857 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants.
[2024-02-28 18:35:57,857 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=702, Unknown=13, NotChecked=110, Total=930
[2024-02-28 18:35:58,000 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 43 out of 193
[2024-02-28 18:35:58,001 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 1900 transitions, 31113 flow. Second operand  has 31 states, 31 states have (on average 45.03225806451613) internal successors, (1396), 31 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:35:58,001 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:35:58,001 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 193
[2024-02-28 18:35:58,002 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:36:29,308 INFO  L130       PetriNetUnfolder]: 37574/61733 cut-off events.
[2024-02-28 18:36:29,308 INFO  L131       PetriNetUnfolder]: For 671407/671407 co-relation queries the response was YES.
[2024-02-28 18:36:29,913 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 470098 conditions, 61733 events. 37574/61733 cut-off events. For 671407/671407 co-relation queries the response was YES. Maximal size of possible extension queue 1665. Compared 484169 event pairs, 3577 based on Foata normal form. 317/62050 useless extension candidates. Maximal degree in co-relation 452430. Up to 28953 conditions per place. 
[2024-02-28 18:36:30,201 INFO  L137   encePairwiseOnDemand]: 150/193 looper letters, 3096 selfloop transitions, 1683 changer transitions 40/4821 dead transitions.
[2024-02-28 18:36:30,201 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 4821 transitions, 85383 flow
[2024-02-28 18:36:30,202 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. 
[2024-02-28 18:36:30,202 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 35 states.
[2024-02-28 18:36:30,204 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 2108 transitions.
[2024-02-28 18:36:30,205 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3120651369356033
[2024-02-28 18:36:30,205 INFO  L72            ComplementDD]: Start complementDD. Operand 35 states and 2108 transitions.
[2024-02-28 18:36:30,205 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 35 states and 2108 transitions.
[2024-02-28 18:36:30,205 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:36:30,205 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 2108 transitions.
[2024-02-28 18:36:30,208 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 36 states, 35 states have (on average 60.22857142857143) internal successors, (2108), 35 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:36:30,213 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 36 states, 36 states have (on average 193.0) internal successors, (6948), 36 states have internal predecessors, (6948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:36:30,213 INFO  L81            ComplementDD]: Finished complementDD. Result  has 36 states, 36 states have (on average 193.0) internal successors, (6948), 36 states have internal predecessors, (6948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:36:30,213 INFO  L175             Difference]: Start difference. First operand has 219 places, 1900 transitions, 31113 flow. Second operand 35 states and 2108 transitions.
[2024-02-28 18:36:30,213 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 4821 transitions, 85383 flow
[2024-02-28 18:36:52,084 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 4821 transitions, 84968 flow, removed 148 selfloop flow, removed 8 redundant places.
[2024-02-28 18:36:52,146 INFO  L231             Difference]: Finished difference. Result has 270 places, 3290 transitions, 62487 flow
[2024-02-28 18:36:52,148 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=30854, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1900, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=452, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=827, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=62487, PETRI_PLACES=270, PETRI_TRANSITIONS=3290}
[2024-02-28 18:36:52,149 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 208 predicate places.
[2024-02-28 18:36:52,149 INFO  L495      AbstractCegarLoop]: Abstraction has has 270 places, 3290 transitions, 62487 flow
[2024-02-28 18:36:52,150 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 31 states, 31 states have (on average 45.03225806451613) internal successors, (1396), 31 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:36:52,150 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:36:52,150 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:36:52,154 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-02-28 18:36:52,351 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2024-02-28 18:36:52,352 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:36:52,352 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:36:52,352 INFO  L85        PathProgramCache]: Analyzing trace with hash 396680715, now seen corresponding path program 4 times
[2024-02-28 18:36:52,352 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:36:52,353 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369925854]
[2024-02-28 18:36:52,353 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:36:52,353 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:36:52,369 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:36:52,964 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:36:52,964 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:36:52,964 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369925854]
[2024-02-28 18:36:52,964 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369925854] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 18:36:52,964 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526833281]
[2024-02-28 18:36:52,964 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-02-28 18:36:52,964 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:36:52,964 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 18:36:52,965 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 18:36:52,967 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-02-28 18:36:53,202 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-02-28 18:36:53,202 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 18:36:53,203 INFO  L263         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 53 conjunts are in the unsatisfiable core
[2024-02-28 18:36:53,207 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 18:36:53,216 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:36:53,217 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15
[2024-02-28 18:36:53,258 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:36:53,274 INFO  L321             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2024-02-28 18:36:53,274 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2024-02-28 18:36:53,458 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-02-28 18:36:53,459 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2024-02-28 18:36:53,532 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2024-02-28 18:36:53,613 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 18:36:53,675 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:36:53,676 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-02-28 18:36:53,764 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-02-28 18:36:53,816 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:36:53,817 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:36:53,817 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-02-28 18:36:53,882 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:36:53,883 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:36:53,884 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:36:53,886 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-02-28 18:36:53,964 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 18:36:54,005 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 18:36:54,031 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 18:36:54,067 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 18:36:54,170 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 18:36:54,221 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:36:54,222 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 18:36:54,385 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false
[2024-02-28 18:36:54,477 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false
[2024-02-28 18:36:54,503 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-02-28 18:36:54,524 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936) .cse1 v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936) .cse1 v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936) .cse1 v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936) .cse1 v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-02-28 18:36:54,800 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-02-28 18:36:54,800 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526833281] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 18:36:54,800 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 18:36:54,801 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 33
[2024-02-28 18:36:54,801 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292152177]
[2024-02-28 18:36:54,801 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 18:36:54,801 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2024-02-28 18:36:54,801 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:36:54,802 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2024-02-28 18:36:54,802 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=802, Unknown=22, NotChecked=244, Total=1190
[2024-02-28 18:36:54,957 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 52 out of 193
[2024-02-28 18:36:54,959 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 3290 transitions, 62487 flow. Second operand  has 35 states, 35 states have (on average 54.08571428571429) internal successors, (1893), 35 states have internal predecessors, (1893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:36:54,959 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:36:54,959 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 193
[2024-02-28 18:36:54,959 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:37:39,139 INFO  L130       PetriNetUnfolder]: 38774/63721 cut-off events.
[2024-02-28 18:37:39,139 INFO  L131       PetriNetUnfolder]: For 1153759/1153759 co-relation queries the response was YES.
[2024-02-28 18:37:39,934 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 567792 conditions, 63721 events. 38774/63721 cut-off events. For 1153759/1153759 co-relation queries the response was YES. Maximal size of possible extension queue 1725. Compared 501786 event pairs, 4188 based on Foata normal form. 80/63801 useless extension candidates. Maximal degree in co-relation 555835. Up to 49262 conditions per place. 
[2024-02-28 18:37:40,240 INFO  L137   encePairwiseOnDemand]: 156/193 looper letters, 2780 selfloop transitions, 1316 changer transitions 9/4107 dead transitions.
[2024-02-28 18:37:40,241 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 4107 transitions, 85468 flow
[2024-02-28 18:37:40,242 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. 
[2024-02-28 18:37:40,242 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 27 states.
[2024-02-28 18:37:40,243 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1806 transitions.
[2024-02-28 18:37:40,244 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3465745538284398
[2024-02-28 18:37:40,244 INFO  L72            ComplementDD]: Start complementDD. Operand 27 states and 1806 transitions.
[2024-02-28 18:37:40,244 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 27 states and 1806 transitions.
[2024-02-28 18:37:40,244 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:37:40,244 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 1806 transitions.
[2024-02-28 18:37:40,246 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 28 states, 27 states have (on average 66.88888888888889) internal successors, (1806), 27 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:37:40,249 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 28 states, 28 states have (on average 193.0) internal successors, (5404), 28 states have internal predecessors, (5404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:37:40,250 INFO  L81            ComplementDD]: Finished complementDD. Result  has 28 states, 28 states have (on average 193.0) internal successors, (5404), 28 states have internal predecessors, (5404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:37:40,250 INFO  L175             Difference]: Start difference. First operand has 270 places, 3290 transitions, 62487 flow. Second operand 27 states and 1806 transitions.
[2024-02-28 18:37:40,250 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 4107 transitions, 85468 flow
[2024-02-28 18:38:21,899 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 4107 transitions, 84789 flow, removed 331 selfloop flow, removed 5 redundant places.
[2024-02-28 18:38:21,965 INFO  L231             Difference]: Finished difference. Result has 306 places, 3645 transitions, 75225 flow
[2024-02-28 18:38:21,967 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=61862, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1002, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=75225, PETRI_PLACES=306, PETRI_TRANSITIONS=3645}
[2024-02-28 18:38:21,967 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 244 predicate places.
[2024-02-28 18:38:21,968 INFO  L495      AbstractCegarLoop]: Abstraction has has 306 places, 3645 transitions, 75225 flow
[2024-02-28 18:38:21,968 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 35 states, 35 states have (on average 54.08571428571429) internal successors, (1893), 35 states have internal predecessors, (1893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:38:21,968 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:38:21,968 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:38:21,973 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-02-28 18:38:22,172 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2024-02-28 18:38:22,173 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:38:22,173 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:38:22,174 INFO  L85        PathProgramCache]: Analyzing trace with hash 776633815, now seen corresponding path program 5 times
[2024-02-28 18:38:22,174 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:38:22,174 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400782675]
[2024-02-28 18:38:22,174 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:38:22,174 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:38:22,193 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:38:22,669 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:38:22,669 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:38:22,669 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400782675]
[2024-02-28 18:38:22,669 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400782675] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 18:38:22,670 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698850464]
[2024-02-28 18:38:22,670 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-02-28 18:38:22,670 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:38:22,670 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 18:38:22,671 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 18:38:22,673 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-02-28 18:38:22,835 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-02-28 18:38:22,835 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 18:38:22,837 INFO  L263         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 47 conjunts are in the unsatisfiable core
[2024-02-28 18:38:22,839 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 18:38:22,862 INFO  L321             Elim1Store]: treesize reduction 23, result has 17.9 percent of original size
[2024-02-28 18:38:22,862 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26
[2024-02-28 18:38:22,902 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:38:22,910 INFO  L321             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-02-28 18:38:22,910 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18
[2024-02-28 18:38:23,026 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-02-28 18:38:23,026 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28
[2024-02-28 18:38:23,081 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:38:23,082 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2024-02-28 18:38:23,138 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 18:38:23,187 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-02-28 18:38:23,239 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-02-28 18:38:23,294 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:38:23,294 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-02-28 18:38:23,355 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:38:23,355 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-02-28 18:38:23,430 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:38:23,431 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 18:38:23,458 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:38:23,460 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 18:38:23,478 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:38:23,479 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 18:38:23,511 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:38:23,511 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 18:38:23,557 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 18:38:23,570 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:38:23,570 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 18:38:23,595 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1045 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1045 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1045 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1045 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false
[2024-02-28 18:38:23,635 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false
[2024-02-28 18:38:23,961 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2024-02-28 18:38:24,247 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:38:24,248 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [698850464] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 18:38:24,248 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 18:38:24,248 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 30
[2024-02-28 18:38:24,248 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379077297]
[2024-02-28 18:38:24,248 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 18:38:24,249 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2024-02-28 18:38:24,249 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:38:24,249 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2024-02-28 18:38:24,250 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=685, Unknown=24, NotChecked=168, Total=992
[2024-02-28 18:38:24,454 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 52 out of 193
[2024-02-28 18:38:24,456 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 3645 transitions, 75225 flow. Second operand  has 32 states, 32 states have (on average 54.125) internal successors, (1732), 32 states have internal predecessors, (1732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:38:24,456 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:38:24,456 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 193
[2024-02-28 18:38:24,456 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:39:14,116 INFO  L130       PetriNetUnfolder]: 39195/64409 cut-off events.
[2024-02-28 18:39:14,116 INFO  L131       PetriNetUnfolder]: For 1367162/1367164 co-relation queries the response was YES.
[2024-02-28 18:39:15,103 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 605122 conditions, 64409 events. 39195/64409 cut-off events. For 1367162/1367164 co-relation queries the response was YES. Maximal size of possible extension queue 1762. Compared 507820 event pairs, 4178 based on Foata normal form. 98/64507 useless extension candidates. Maximal degree in co-relation 593094. Up to 48933 conditions per place. 
[2024-02-28 18:39:15,436 INFO  L137   encePairwiseOnDemand]: 155/193 looper letters, 2957 selfloop transitions, 1481 changer transitions 9/4449 dead transitions.
[2024-02-28 18:39:15,436 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 4449 transitions, 99440 flow
[2024-02-28 18:39:15,437 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2024-02-28 18:39:15,437 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2024-02-28 18:39:15,439 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1638 transitions.
[2024-02-28 18:39:15,439 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3536269430051813
[2024-02-28 18:39:15,439 INFO  L72            ComplementDD]: Start complementDD. Operand 24 states and 1638 transitions.
[2024-02-28 18:39:15,439 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 24 states and 1638 transitions.
[2024-02-28 18:39:15,440 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:39:15,440 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1638 transitions.
[2024-02-28 18:39:15,441 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 25 states, 24 states have (on average 68.25) internal successors, (1638), 24 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:39:15,444 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 25 states, 25 states have (on average 193.0) internal successors, (4825), 25 states have internal predecessors, (4825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:39:15,445 INFO  L81            ComplementDD]: Finished complementDD. Result  has 25 states, 25 states have (on average 193.0) internal successors, (4825), 25 states have internal predecessors, (4825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:39:15,445 INFO  L175             Difference]: Start difference. First operand has 306 places, 3645 transitions, 75225 flow. Second operand 24 states and 1638 transitions.
[2024-02-28 18:39:15,445 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 4449 transitions, 99440 flow
[2024-02-28 18:40:07,029 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 4449 transitions, 98416 flow, removed 406 selfloop flow, removed 11 redundant places.
[2024-02-28 18:40:07,104 INFO  L231             Difference]: Finished difference. Result has 332 places, 3977 transitions, 88467 flow
[2024-02-28 18:40:07,106 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=74278, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3645, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=88467, PETRI_PLACES=332, PETRI_TRANSITIONS=3977}
[2024-02-28 18:40:07,107 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 270 predicate places.
[2024-02-28 18:40:07,107 INFO  L495      AbstractCegarLoop]: Abstraction has has 332 places, 3977 transitions, 88467 flow
[2024-02-28 18:40:07,107 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 32 states have (on average 54.125) internal successors, (1732), 32 states have internal predecessors, (1732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:40:07,107 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:40:07,107 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:40:07,117 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2024-02-28 18:40:07,308 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2024-02-28 18:40:07,308 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:40:07,309 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:40:07,309 INFO  L85        PathProgramCache]: Analyzing trace with hash 607048284, now seen corresponding path program 1 times
[2024-02-28 18:40:07,310 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:40:07,310 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195538399]
[2024-02-28 18:40:07,310 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:40:07,310 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:40:07,329 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:40:07,704 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:40:07,704 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:40:07,704 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195538399]
[2024-02-28 18:40:07,704 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195538399] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 18:40:07,704 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576869094]
[2024-02-28 18:40:07,704 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:40:07,705 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:40:07,705 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 18:40:07,706 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 18:40:07,708 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2024-02-28 18:40:07,830 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:40:07,832 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 38 conjunts are in the unsatisfiable core
[2024-02-28 18:40:07,838 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 18:40:07,846 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:40:07,847 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15
[2024-02-28 18:40:07,881 INFO  L321             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-02-28 18:40:07,882 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-02-28 18:40:08,008 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-02-28 18:40:08,008 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2024-02-28 18:40:08,059 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:40:08,060 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2024-02-28 18:40:08,124 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-02-28 18:40:08,145 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 18:40:08,153 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 18:40:08,165 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:40:08,165 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 18:40:08,177 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2024-02-28 18:40:08,190 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:40:08,190 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 18:40:08,200 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:40:08,200 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 18:40:08,228 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1150 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1150) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1150 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1150) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1150 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1150) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1 .cse0)) 0)))) is different from false
[2024-02-28 18:40:08,243 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_1150 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1150) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1150 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1150) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse2) 0)) (forall ((v_ArrVal_1150 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1150) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1 .cse1)) 0)))))) is different from false
[2024-02-28 18:40:08,256 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1 .cse1)) (.cse2 (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_1150 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1150) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1150 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1150) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse2))) (forall ((v_ArrVal_1150 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1150) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse3) 0)))))) is different from false
[2024-02-28 18:40:08,269 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:40:08,269 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 54
[2024-02-28 18:40:08,273 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:40:08,274 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 35
[2024-02-28 18:40:08,281 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 18:40:08,282 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 1
[2024-02-28 18:40:08,285 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 18:40:08,286 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 1
[2024-02-28 18:40:08,304 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1143 (Array Int Int))) (not (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1143) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2024-02-28 18:40:08,308 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1143 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1143) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~t~1#1.base|))) is different from false
[2024-02-28 18:40:08,351 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1143 (Array Int Int)) (v_ArrVal_1142 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1142) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1143) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~t~1#1.base|))) is different from false
[2024-02-28 18:40:08,404 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:40:08,404 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [576869094] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 18:40:08,404 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 18:40:08,405 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 25
[2024-02-28 18:40:08,405 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142923683]
[2024-02-28 18:40:08,405 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 18:40:08,406 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2024-02-28 18:40:08,406 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:40:08,406 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2024-02-28 18:40:08,407 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=360, Unknown=10, NotChecked=258, Total=702
[2024-02-28 18:40:08,604 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 49 out of 193
[2024-02-28 18:40:08,605 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 3977 transitions, 88467 flow. Second operand  has 27 states, 27 states have (on average 51.111111111111114) internal successors, (1380), 27 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:40:08,605 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:40:08,605 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 193
[2024-02-28 18:40:08,605 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:41:07,853 INFO  L130       PetriNetUnfolder]: 41034/67421 cut-off events.
[2024-02-28 18:41:07,853 INFO  L131       PetriNetUnfolder]: For 1814869/1814871 co-relation queries the response was YES.
[2024-02-28 18:41:08,995 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 682890 conditions, 67421 events. 41034/67421 cut-off events. For 1814869/1814871 co-relation queries the response was YES. Maximal size of possible extension queue 1887. Compared 535022 event pairs, 3945 based on Foata normal form. 403/67824 useless extension candidates. Maximal degree in co-relation 675470. Up to 31408 conditions per place. 
[2024-02-28 18:41:09,354 INFO  L137   encePairwiseOnDemand]: 167/193 looper letters, 4014 selfloop transitions, 1991 changer transitions 21/6028 dead transitions.
[2024-02-28 18:41:09,355 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 6028 transitions, 142488 flow
[2024-02-28 18:41:09,355 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2024-02-28 18:41:09,355 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2024-02-28 18:41:09,357 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1629 transitions.
[2024-02-28 18:41:09,357 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3246313272220008
[2024-02-28 18:41:09,357 INFO  L72            ComplementDD]: Start complementDD. Operand 26 states and 1629 transitions.
[2024-02-28 18:41:09,357 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 1629 transitions.
[2024-02-28 18:41:09,358 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:41:09,358 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1629 transitions.
[2024-02-28 18:41:09,359 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 27 states, 26 states have (on average 62.65384615384615) internal successors, (1629), 26 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:41:09,363 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 27 states, 27 states have (on average 193.0) internal successors, (5211), 27 states have internal predecessors, (5211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:41:09,363 INFO  L81            ComplementDD]: Finished complementDD. Result  has 27 states, 27 states have (on average 193.0) internal successors, (5211), 27 states have internal predecessors, (5211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:41:09,363 INFO  L175             Difference]: Start difference. First operand has 332 places, 3977 transitions, 88467 flow. Second operand 26 states and 1629 transitions.
[2024-02-28 18:41:09,363 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 6028 transitions, 142488 flow
[2024-02-28 18:42:21,794 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 6028 transitions, 141031 flow, removed 672 selfloop flow, removed 8 redundant places.
[2024-02-28 18:42:21,890 INFO  L231             Difference]: Finished difference. Result has 365 places, 4965 transitions, 117761 flow
[2024-02-28 18:42:21,893 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=87078, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3969, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1073, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2660, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=117761, PETRI_PLACES=365, PETRI_TRANSITIONS=4965}
[2024-02-28 18:42:21,893 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 303 predicate places.
[2024-02-28 18:42:21,893 INFO  L495      AbstractCegarLoop]: Abstraction has has 365 places, 4965 transitions, 117761 flow
[2024-02-28 18:42:21,894 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 27 states have (on average 51.111111111111114) internal successors, (1380), 27 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:42:21,894 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:42:21,894 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:42:21,901 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2024-02-28 18:42:22,095 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2024-02-28 18:42:22,096 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:42:22,096 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:42:22,096 INFO  L85        PathProgramCache]: Analyzing trace with hash -830470197, now seen corresponding path program 6 times
[2024-02-28 18:42:22,096 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:42:22,097 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809727663]
[2024-02-28 18:42:22,097 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:42:22,097 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:42:22,114 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:42:22,619 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:42:22,619 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:42:22,620 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809727663]
[2024-02-28 18:42:22,620 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809727663] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 18:42:22,620 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930572159]
[2024-02-28 18:42:22,620 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-02-28 18:42:22,620 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:42:22,620 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 18:42:22,621 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 18:42:22,622 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2024-02-28 18:42:22,778 INFO  L228   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s)
[2024-02-28 18:42:22,778 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 18:42:22,780 INFO  L263         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 76 conjunts are in the unsatisfiable core
[2024-02-28 18:42:22,791 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 18:42:22,813 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:42:22,814 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15
[2024-02-28 18:42:22,860 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:42:22,875 INFO  L321             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2024-02-28 18:42:22,875 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2024-02-28 18:42:23,086 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-02-28 18:42:23,086 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37
[2024-02-28 18:42:23,093 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:42:23,094 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2024-02-28 18:42:23,166 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2024-02-28 18:42:23,176 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2024-02-28 18:42:23,321 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-02-28 18:42:23,333 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2024-02-28 18:42:23,419 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 18:42:23,484 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:42:23,484 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-02-28 18:42:23,557 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:42:23,557 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:42:23,558 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-02-28 18:42:23,645 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:42:23,647 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:42:23,648 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:42:23,649 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-02-28 18:42:23,729 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:42:23,730 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:42:23,731 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:42:23,732 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56
[2024-02-28 18:42:23,774 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:42:23,775 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:42:23,776 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:42:23,777 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56
[2024-02-28 18:42:24,060 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:42:24,061 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:42:24,061 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:42:24,062 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 18:42:24,063 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 84
[2024-02-28 18:42:24,156 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:42:24,156 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 18:42:25,251 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1104 treesize of output 1100
[2024-02-28 18:42:51,714 WARN  L233               SmtUtils]: Spent 24.51s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-02-28 18:43:16,294 WARN  L233               SmtUtils]: Spent 24.34s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-02-28 18:43:22,904 WARN  L233               SmtUtils]: Spent 6.39s on a formula simplification. DAG size of input: 72 DAG size of output: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-02-28 18:43:23,342 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~#tids~0#1.base| |c_ULTIMATE.start_main_~t~1#1.base|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~t~1#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~t~1#1.offset| 1)) (.cse2 (+ 2 |c_ULTIMATE.start_main_~t~1#1.offset|))) (or (and .cse0 (= .cse1 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (and .cse0 (= |c_ULTIMATE.start_main_~t~1#1.offset| |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (and .cse0 (= .cse2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (and .cse0 (= .cse3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse5 (forall ((v_ArrVal_1248 (Array Int Int)) (v_ArrVal_1245 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_1245) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1248) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~t~1#1.base|))))) (and (or (forall ((v_ArrVal_1247 (Array Int Int)) (v_ArrVal_1246 (Array Int Int))) (not (= .cse1 (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1246) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1247) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) .cse5) (or .cse5 (forall ((v_ArrVal_1247 (Array Int Int)) (v_ArrVal_1246 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~t~1#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1246) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1247) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) (or (forall ((v_ArrVal_1247 (Array Int Int)) (v_ArrVal_1246 (Array Int Int))) (not (= .cse3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1246) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1247) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) .cse5) (or (forall ((v_ArrVal_1247 (Array Int Int)) (v_ArrVal_1246 (Array Int Int))) (not (= .cse2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1246) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1247) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) .cse5)))) (not (< 0 |c_ULTIMATE.start_main_~threads_total~0#1|)))) is different from false
[2024-02-28 18:43:26,141 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:43:26,141 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930572159] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 18:43:26,141 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 18:43:26,141 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 16] total 42
[2024-02-28 18:43:26,142 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086218875]
[2024-02-28 18:43:26,142 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 18:43:26,142 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 44 states
[2024-02-28 18:43:26,142 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:43:26,143 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants.
[2024-02-28 18:43:26,143 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1586, Unknown=3, NotChecked=82, Total=1892
[2024-02-28 18:43:31,211 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 44 out of 193
[2024-02-28 18:43:31,214 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 4965 transitions, 117761 flow. Second operand  has 44 states, 44 states have (on average 45.75) internal successors, (2013), 44 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:43:31,214 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:43:31,214 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 193
[2024-02-28 18:43:31,214 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:45:28,347 INFO  L130       PetriNetUnfolder]: 54688/89089 cut-off events.
[2024-02-28 18:45:28,348 INFO  L131       PetriNetUnfolder]: For 2692568/2692570 co-relation queries the response was YES.
[2024-02-28 18:45:30,126 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 949601 conditions, 89089 events. 54688/89089 cut-off events. For 2692568/2692570 co-relation queries the response was YES. Maximal size of possible extension queue 2508. Compared 732312 event pairs, 4735 based on Foata normal form. 152/89241 useless extension candidates. Maximal degree in co-relation 940003. Up to 32605 conditions per place. 
[2024-02-28 18:45:30,631 INFO  L137   encePairwiseOnDemand]: 151/193 looper letters, 4990 selfloop transitions, 4235 changer transitions 36/9263 dead transitions.
[2024-02-28 18:45:30,631 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 9263 transitions, 232356 flow
[2024-02-28 18:45:30,632 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. 
[2024-02-28 18:45:30,632 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 47 states.
[2024-02-28 18:45:30,634 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 2787 transitions.
[2024-02-28 18:45:30,635 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3072428618674898
[2024-02-28 18:45:30,635 INFO  L72            ComplementDD]: Start complementDD. Operand 47 states and 2787 transitions.
[2024-02-28 18:45:30,635 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 47 states and 2787 transitions.
[2024-02-28 18:45:30,635 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:45:30,635 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 2787 transitions.
[2024-02-28 18:45:30,640 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 48 states, 47 states have (on average 59.297872340425535) internal successors, (2787), 47 states have internal predecessors, (2787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:45:30,646 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 48 states, 48 states have (on average 193.0) internal successors, (9264), 48 states have internal predecessors, (9264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:45:30,647 INFO  L81            ComplementDD]: Finished complementDD. Result  has 48 states, 48 states have (on average 193.0) internal successors, (9264), 48 states have internal predecessors, (9264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:45:30,647 INFO  L175             Difference]: Start difference. First operand has 365 places, 4965 transitions, 117761 flow. Second operand 47 states and 2787 transitions.
[2024-02-28 18:45:30,647 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 9263 transitions, 232356 flow
Killed by 15
