./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-divine/divinefifo_1w1r.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d2ba6107 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-divine/divinefifo_1w1r.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 43c4691e367ff0d8a9949fa90f15eddbc091ab75ed1546de74dafe83c2376639 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-d2ba610-m [2023-11-21 21:34:56,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 21:34:56,472 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2023-11-21 21:34:56,476 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 21:34:56,477 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 21:34:56,495 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 21:34:56,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 21:34:56,496 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 21:34:56,497 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 21:34:56,497 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 21:34:56,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 21:34:56,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 21:34:56,498 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 21:34:56,499 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 21:34:56,499 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 21:34:56,500 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 21:34:56,500 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 21:34:56,500 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 21:34:56,501 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 21:34:56,501 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 21:34:56,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 21:34:56,502 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 21:34:56,503 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-21 21:34:56,503 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 21:34:56,504 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 21:34:56,504 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 21:34:56,504 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 21:34:56,505 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 21:34:56,505 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 21:34:56,506 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-21 21:34:56,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 21:34:56,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 21:34:56,507 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 21:34:56,507 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 21:34:56,508 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 21:34:56,508 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 21:34:56,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 21:34:56,509 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 21:34:56,509 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-11-21 21:34:56,510 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-21 21:34:56,510 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 21:34:56,511 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-21 21:34:56,511 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-21 21:34:56,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-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 -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> GemCutter 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 -> 43c4691e367ff0d8a9949fa90f15eddbc091ab75ed1546de74dafe83c2376639 [2023-11-21 21:34:56,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 21:34:56,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 21:34:56,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 21:34:56,818 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 21:34:56,819 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 21:34:56,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-divine/divinefifo_1w1r.i [2023-11-21 21:34:58,126 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 21:34:58,408 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 21:34:58,408 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo_1w1r.i [2023-11-21 21:34:58,431 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/4a1ae3ee1/5dce5056a68d472db6af3fedc686eb23/FLAG3d4e7a0ae [2023-11-21 21:34:58,444 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/4a1ae3ee1/5dce5056a68d472db6af3fedc686eb23 [2023-11-21 21:34:58,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 21:34:58,448 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 21:34:58,451 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 21:34:58,451 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 21:34:58,456 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 21:34:58,457 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:34:58" (1/1) ... [2023-11-21 21:34:58,460 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@530b8d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:34:58, skipping insertion in model container [2023-11-21 21:34:58,460 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:34:58" (1/1) ... [2023-11-21 21:34:58,521 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 21:34:58,699 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-21 21:34:59,096 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 21:34:59,107 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 21:34:59,119 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-21 21:34:59,232 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 21:34:59,296 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 21:34:59,303 INFO L206 MainTranslator]: Completed translation [2023-11-21 21:34:59,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:34:59 WrapperNode [2023-11-21 21:34:59,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 21:34:59,306 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 21:34:59,307 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 21:34:59,307 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 21:34:59,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:34:59" (1/1) ... [2023-11-21 21:34:59,365 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:34:59" (1/1) ... [2023-11-21 21:34:59,432 INFO L138 Inliner]: procedures = 278, calls = 110, calls flagged for inlining = 27, calls inlined = 29, statements flattened = 959 [2023-11-21 21:34:59,433 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 21:34:59,434 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 21:34:59,434 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 21:34:59,434 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 21:34:59,443 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:34:59" (1/1) ... [2023-11-21 21:34:59,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:34:59" (1/1) ... [2023-11-21 21:34:59,458 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:34:59" (1/1) ... [2023-11-21 21:34:59,458 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:34:59" (1/1) ... [2023-11-21 21:34:59,547 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:34:59" (1/1) ... [2023-11-21 21:34:59,570 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:34:59" (1/1) ... [2023-11-21 21:34:59,580 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:34:59" (1/1) ... [2023-11-21 21:34:59,585 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:34:59" (1/1) ... [2023-11-21 21:34:59,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 21:34:59,595 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 21:34:59,595 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 21:34:59,596 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 21:34:59,596 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:34:59" (1/1) ... [2023-11-21 21:34:59,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 21:34:59,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:34:59,629 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 21:34:59,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 21:34:59,677 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2023-11-21 21:34:59,678 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2023-11-21 21:34:59,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 21:34:59,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-21 21:34:59,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 21:34:59,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-21 21:34:59,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 21:34:59,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 21:34:59,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 21:34:59,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-21 21:34:59,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 21:34:59,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 21:34:59,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 21:34:59,683 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 21:34:59,878 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 21:34:59,880 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 21:35:01,279 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 21:35:01,376 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 21:35:01,378 INFO L308 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-21 21:35:01,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:35:01 BoogieIcfgContainer [2023-11-21 21:35:01,381 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 21:35:01,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 21:35:01,383 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 21:35:01,394 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 21:35:01,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:34:58" (1/3) ... [2023-11-21 21:35:01,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e1875d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:35:01, skipping insertion in model container [2023-11-21 21:35:01,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:34:59" (2/3) ... [2023-11-21 21:35:01,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e1875d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:35:01, skipping insertion in model container [2023-11-21 21:35:01,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:35:01" (3/3) ... [2023-11-21 21:35:01,400 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.i [2023-11-21 21:35:01,408 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 21:35:01,416 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 21:35:01,416 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 97 error locations. [2023-11-21 21:35:01,416 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 21:35:01,545 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-21 21:35:01,601 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 21:35:01,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 21:35:01,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:35:01,608 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-21 21:35:01,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-11-21 21:35:01,651 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 21:35:01,660 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == pusherThread1of1ForFork0 ======== [2023-11-21 21:35:01,666 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@218500ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 21:35:01,666 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-11-21 21:35:02,173 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting pusherErr0ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-21 21:35:02,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:35:02,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1242994112, now seen corresponding path program 1 times [2023-11-21 21:35:02,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:35:02,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511358211] [2023-11-21 21:35:02,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:35:02,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:35:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:35:02,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:35:02,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:35:02,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511358211] [2023-11-21 21:35:02,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511358211] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:35:02,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:35:02,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:35:02,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759829357] [2023-11-21 21:35:02,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:35:02,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 21:35:02,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:35:02,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 21:35:02,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 21:35:02,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:02,692 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:35:02,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 77.5) internal successors, (155), 2 states have internal predecessors, (155), 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) [2023-11-21 21:35:02,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:02,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:02,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 21:35:02,769 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting pusherErr0ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-21 21:35:02,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:35:02,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1855609912, now seen corresponding path program 1 times [2023-11-21 21:35:02,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:35:02,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599205172] [2023-11-21 21:35:02,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:35:02,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:35:02,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:35:03,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:35:03,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:35:03,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599205172] [2023-11-21 21:35:03,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599205172] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:35:03,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:35:03,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:35:03,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910063291] [2023-11-21 21:35:03,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:35:03,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:35:03,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:35:03,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:35:03,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:35:03,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:03,907 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:35:03,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 30.4) internal successors, (152), 6 states have internal predecessors, (152), 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) [2023-11-21 21:35:03,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:03,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:04,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:04,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:04,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 21:35:04,313 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting pusherErr1ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-21 21:35:04,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:35:04,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1904189980, now seen corresponding path program 1 times [2023-11-21 21:35:04,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:35:04,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680365624] [2023-11-21 21:35:04,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:35:04,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:35:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:35:05,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:35:05,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:35:05,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680365624] [2023-11-21 21:35:05,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680365624] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:35:05,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:35:05,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:35:05,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489389259] [2023-11-21 21:35:05,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:35:05,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:35:05,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:35:05,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:35:05,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:35:05,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:05,310 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:35:05,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 31.6) internal successors, (158), 6 states have internal predecessors, (158), 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) [2023-11-21 21:35:05,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:05,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:05,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:05,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:05,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:05,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:05,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 21:35:05,669 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting pusherErr3ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-21 21:35:05,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:35:05,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1663814895, now seen corresponding path program 1 times [2023-11-21 21:35:05,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:35:05,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655633357] [2023-11-21 21:35:05,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:35:05,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:35:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:35:06,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:35:06,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:35:06,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655633357] [2023-11-21 21:35:06,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655633357] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:35:06,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:35:06,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:35:06,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555418794] [2023-11-21 21:35:06,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:35:06,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:35:06,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:35:06,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:35:06,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:35:06,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:06,382 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:35:06,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 36.0) internal successors, (180), 6 states have internal predecessors, (180), 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) [2023-11-21 21:35:06,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:06,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:06,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:06,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:06,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:06,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:06,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:06,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:06,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 21:35:06,657 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting pusherErr4ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-21 21:35:06,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:35:06,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1496109212, now seen corresponding path program 1 times [2023-11-21 21:35:06,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:35:06,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426562082] [2023-11-21 21:35:06,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:35:06,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:35:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:35:07,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:35:07,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:35:07,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426562082] [2023-11-21 21:35:07,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426562082] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:35:07,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:35:07,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:35:07,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659674094] [2023-11-21 21:35:07,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:35:07,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:35:07,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:35:07,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:35:07,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:35:07,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:07,329 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:35:07,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 37.4) internal successors, (187), 6 states have internal predecessors, (187), 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) [2023-11-21 21:35:07,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:07,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:07,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:07,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:07,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:07,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:07,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:07,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:07,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:07,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:07,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 21:35:07,559 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting pusherErr5ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-21 21:35:07,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:35:07,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1125696323, now seen corresponding path program 1 times [2023-11-21 21:35:07,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:35:07,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333130715] [2023-11-21 21:35:07,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:35:07,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:35:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:35:08,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:35:08,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:35:08,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333130715] [2023-11-21 21:35:08,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333130715] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:35:08,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:35:08,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:35:08,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794678507] [2023-11-21 21:35:08,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:35:08,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:35:08,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:35:08,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:35:08,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:35:08,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:08,321 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:35:08,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 39.2) internal successors, (196), 6 states have internal predecessors, (196), 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) [2023-11-21 21:35:08,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:08,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:08,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:08,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:08,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:08,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:08,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:08,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:08,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:08,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:08,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:08,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:08,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 21:35:08,699 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting pusherErr7ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-21 21:35:08,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:35:08,699 INFO L85 PathProgramCache]: Analyzing trace with hash -2102475212, now seen corresponding path program 1 times [2023-11-21 21:35:08,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:35:08,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629575946] [2023-11-21 21:35:08,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:35:08,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:35:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:35:09,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:35:09,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:35:09,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629575946] [2023-11-21 21:35:09,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629575946] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:35:09,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:35:09,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:35:09,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360490810] [2023-11-21 21:35:09,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:35:09,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:35:09,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:35:09,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:35:09,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:35:09,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:09,384 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:35:09,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 42.0) internal successors, (210), 6 states have internal predecessors, (210), 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) [2023-11-21 21:35:09,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:09,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:09,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:09,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:09,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:09,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:09,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:09,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:09,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:09,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:09,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:09,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:09,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:09,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:09,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 21:35:09,737 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting pusherErr8ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-21 21:35:09,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:35:09,738 INFO L85 PathProgramCache]: Analyzing trace with hash -762623489, now seen corresponding path program 1 times [2023-11-21 21:35:09,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:35:09,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398004340] [2023-11-21 21:35:09,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:35:09,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:35:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:35:10,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:35:10,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:35:10,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398004340] [2023-11-21 21:35:10,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398004340] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:35:10,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:35:10,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:35:10,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511569576] [2023-11-21 21:35:10,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:35:10,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:35:10,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:35:10,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:35:10,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:35:10,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:10,507 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:35:10,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 43.4) internal successors, (217), 6 states have internal predecessors, (217), 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) [2023-11-21 21:35:10,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:10,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:10,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:10,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:10,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:10,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:10,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:10,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:10,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:10,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:10,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:10,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:10,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:10,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:10,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:10,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:10,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 21:35:10,991 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting pusherErr10ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-21 21:35:10,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:35:10,991 INFO L85 PathProgramCache]: Analyzing trace with hash -22620368, now seen corresponding path program 1 times [2023-11-21 21:35:10,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:35:10,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327577937] [2023-11-21 21:35:10,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:35:10,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:35:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:35:11,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:35:11,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:35:11,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327577937] [2023-11-21 21:35:11,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327577937] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:35:11,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:35:11,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:35:11,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667680239] [2023-11-21 21:35:11,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:35:11,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:35:11,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:35:11,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:35:11,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:35:11,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:11,827 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:35:11,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 46.6) internal successors, (233), 6 states have internal predecessors, (233), 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) [2023-11-21 21:35:11,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:11,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:11,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:11,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:11,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:11,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:11,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:11,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:11,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:12,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:12,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:12,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:12,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:12,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:12,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:12,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:12,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:12,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:12,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 21:35:12,472 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting pusherErr13ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-21 21:35:12,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:35:12,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1675878496, now seen corresponding path program 1 times [2023-11-21 21:35:12,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:35:12,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146635938] [2023-11-21 21:35:12,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:35:12,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:35:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:35:13,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:35:13,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:35:13,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146635938] [2023-11-21 21:35:13,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146635938] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:35:13,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:35:13,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:35:13,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723916511] [2023-11-21 21:35:13,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:35:13,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:35:13,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:35:13,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:35:13,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:35:13,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:13,338 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:35:13,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 51.4) internal successors, (257), 6 states have internal predecessors, (257), 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) [2023-11-21 21:35:13,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:13,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:13,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:13,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:13,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:13,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:13,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:13,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:13,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:13,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:13,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:13,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:13,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:13,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:13,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:13,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:13,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:13,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:13,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:13,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:13,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 21:35:13,832 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting pusherErr14ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-21 21:35:13,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:35:13,833 INFO L85 PathProgramCache]: Analyzing trace with hash -947869597, now seen corresponding path program 1 times [2023-11-21 21:35:13,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:35:13,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949594364] [2023-11-21 21:35:13,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:35:13,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:35:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:35:14,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:35:14,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:35:14,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949594364] [2023-11-21 21:35:14,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949594364] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:35:14,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:35:14,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:35:14,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451804478] [2023-11-21 21:35:14,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:35:14,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:35:14,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:35:14,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:35:14,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:35:14,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:14,728 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:35:14,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 53.2) internal successors, (266), 6 states have internal predecessors, (266), 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) [2023-11-21 21:35:14,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:14,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:14,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:14,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:14,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:14,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:14,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:14,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:14,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:14,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:14,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:15,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:15,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:15,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:15,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:15,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:15,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:15,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:15,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:15,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:15,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:15,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:15,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 21:35:15,198 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting pusherErr14ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-21 21:35:15,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:35:15,198 INFO L85 PathProgramCache]: Analyzing trace with hash -87609761, now seen corresponding path program 1 times [2023-11-21 21:35:15,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:35:15,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563208512] [2023-11-21 21:35:15,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:35:15,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:35:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:35:17,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:35:17,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:35:17,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563208512] [2023-11-21 21:35:17,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563208512] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:35:17,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:35:17,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-21 21:35:17,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636375187] [2023-11-21 21:35:17,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:35:17,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-21 21:35:17,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:35:17,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-21 21:35:17,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2023-11-21 21:35:17,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:17,723 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:35:17,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 17.6875) internal successors, (283), 17 states have internal predecessors, (283), 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) [2023-11-21 21:35:17,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:17,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:17,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:17,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:17,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:17,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:17,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:17,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:17,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:17,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:17,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:17,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:19,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:19,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:19,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:19,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:19,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:19,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:19,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:19,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:19,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:19,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:19,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:19,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-21 21:35:19,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 21:35:19,972 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting pusherErr14ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-21 21:35:19,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:35:19,973 INFO L85 PathProgramCache]: Analyzing trace with hash 92129918, now seen corresponding path program 1 times [2023-11-21 21:35:19,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:35:19,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561868855] [2023-11-21 21:35:19,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:35:19,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:35:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:35:22,665 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:35:22,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:35:22,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561868855] [2023-11-21 21:35:22,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561868855] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:35:22,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338960508] [2023-11-21 21:35:22,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:35:22,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:35:22,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:35:22,705 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:35:22,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 21:35:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:35:23,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 1638 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-21 21:35:23,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:35:24,482 INFO L378 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 13 treesize of output 9 [2023-11-21 21:35:24,513 INFO L378 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 22 [2023-11-21 21:35:24,556 INFO L378 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 32 treesize of output 34 [2023-11-21 21:35:24,604 INFO L378 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 41 treesize of output 46 [2023-11-21 21:35:24,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:35:24,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:35:24,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:35:24,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:35:24,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:35:24,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58 [2023-11-21 21:35:24,733 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:35:24,733 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:35:27,918 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:35:27,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338960508] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 21:35:27,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 21:35:27,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 45 [2023-11-21 21:35:27,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134901005] [2023-11-21 21:35:27,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 21:35:27,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-11-21 21:35:27,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:35:27,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-11-21 21:35:27,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1876, Unknown=0, NotChecked=0, Total=2070 [2023-11-21 21:35:27,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:27,925 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:35:27,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 24.377777777777776) internal successors, (1097), 46 states have internal predecessors, (1097), 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) [2023-11-21 21:35:27,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:27,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:27,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:27,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:27,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:27,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:27,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:27,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:27,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:27,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:27,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:27,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-11-21 21:35:27,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:32,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:32,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:32,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:32,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:32,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:32,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:32,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:32,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:32,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:32,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:32,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:32,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-21 21:35:32,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-21 21:35:32,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-21 21:35:32,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-21 21:35:32,226 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting pusherErr14ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-21 21:35:32,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:35:32,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1211210619, now seen corresponding path program 1 times [2023-11-21 21:35:32,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:35:32,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704824687] [2023-11-21 21:35:32,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:35:32,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:35:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:35:54,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 1196 trivial. 0 not checked. [2023-11-21 21:35:54,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:35:54,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704824687] [2023-11-21 21:35:54,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704824687] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:35:54,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:35:54,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2023-11-21 21:35:54,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608715361] [2023-11-21 21:35:54,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:35:54,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-21 21:35:54,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:35:54,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-21 21:35:54,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1048, Unknown=0, NotChecked=0, Total=1190 [2023-11-21 21:35:54,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:54,274 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:35:54,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 9.17142857142857) internal successors, (321), 35 states have internal predecessors, (321), 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) [2023-11-21 21:35:54,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:54,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:54,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:54,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:54,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:54,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:54,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:54,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:54,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:54,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:54,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:54,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-11-21 21:35:54,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-21 21:35:54,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:59,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:35:59,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:59,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:59,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:59,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:59,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:59,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:59,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:59,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:59,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:59,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:35:59,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-21 21:35:59,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-21 21:35:59,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-11-21 21:35:59,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-21 21:35:59,593 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting pusherErr14ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-21 21:35:59,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:35:59,594 INFO L85 PathProgramCache]: Analyzing trace with hash -857448532, now seen corresponding path program 1 times [2023-11-21 21:35:59,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:35:59,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483481476] [2023-11-21 21:35:59,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:35:59,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:36:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:36:15,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1755 backedges. 534 proven. 25 refuted. 0 times theorem prover too weak. 1196 trivial. 0 not checked. [2023-11-21 21:36:15,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:36:15,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483481476] [2023-11-21 21:36:15,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483481476] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:36:15,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756053641] [2023-11-21 21:36:15,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:36:15,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:36:15,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:36:15,723 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:36:15,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-21 21:36:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:36:16,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 3696 conjuncts, 164 conjunts are in the unsatisfiable core [2023-11-21 21:36:16,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:36:18,410 INFO L378 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 13 treesize of output 9 [2023-11-21 21:36:18,413 INFO L378 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 19 treesize of output 1 [2023-11-21 21:36:18,961 INFO L378 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 [2023-11-21 21:36:18,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:36:18,973 INFO L378 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 25 treesize of output 13 [2023-11-21 21:36:19,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:36:19,136 INFO L378 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 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-21 21:36:19,148 INFO L378 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 11 [2023-11-21 21:36:19,271 INFO L378 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 19 treesize of output 18 [2023-11-21 21:36:19,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:36:19,296 INFO L378 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 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-21 21:36:20,120 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2023-11-21 21:36:20,121 INFO L378 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 58 treesize of output 46 [2023-11-21 21:36:20,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 22 [2023-11-21 21:36:20,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:36:20,139 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2023-11-21 21:36:20,139 INFO L378 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 39 treesize of output 26 [2023-11-21 21:36:20,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:36:20,532 INFO L378 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 0 case distinctions, treesize of input 45 treesize of output 25 [2023-11-21 21:36:20,552 INFO L378 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 15 treesize of output 7 [2023-11-21 21:36:21,219 INFO L349 Elim1Store]: treesize reduction 17, result has 34.6 percent of original size [2023-11-21 21:36:21,220 INFO L378 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 51 treesize of output 52 [2023-11-21 21:36:21,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:36:21,235 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2023-11-21 21:36:21,235 INFO L378 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 33 treesize of output 31 [2023-11-21 21:36:21,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2023-11-21 21:36:21,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 33 treesize of output 21 [2023-11-21 21:36:21,404 INFO L378 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 19 treesize of output 1 [2023-11-21 21:36:21,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:36:21,409 INFO L378 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 27 treesize of output 26 [2023-11-21 21:36:21,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:36:21,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 10 [2023-11-21 21:36:22,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1755 backedges. 1316 proven. 115 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2023-11-21 21:36:22,094 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:36:22,742 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6407 (Array Int Int)) (v_ArrVal_6406 (Array Int Int))) (let ((.cse6 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse3 (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem38#1.base| v_ArrVal_6407))) (store .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))) (.cse0 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem38#1.base| v_ArrVal_6406))) (store .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))) (.cse4 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))) (let ((.cse1 (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4)) (.cse2 (+ 12 (select (select .cse3 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4)))) (or (not (= (select (select .cse0 .cse1) .cse2) .cse1)) (< (select (select .cse3 .cse1) .cse2) .cse2)))))) is different from false [2023-11-21 21:36:22,828 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6407 (Array Int Int)) (v_ArrVal_6406 (Array Int Int))) (let ((.cse6 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6))) (let ((.cse3 (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_6406))) (store .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))) (.cse0 (let ((.cse5 (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_6407))) (store .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))) (.cse4 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))) (let ((.cse2 (+ (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4) 12)) (.cse1 (select (select .cse3 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4))) (or (< (select (select .cse0 .cse1) .cse2) .cse2) (not (= (select (select .cse3 .cse1) .cse2) .cse1)))))))) is different from false [2023-11-21 21:37:31,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:37:31,337 INFO L378 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 754 treesize of output 546 [2023-11-21 21:37:31,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:37:31,395 INFO L378 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 775 treesize of output 558 [2023-11-21 21:37:31,444 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| 4)) (.cse9 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse11 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse4 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (.cse6 (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) (.cse5 (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (and (forall ((v_ArrVal_6393 Int) (v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_6401 Int) (v_ArrVal_6407 (Array Int Int)) (v_ArrVal_6400 Int) (v_ArrVal_6406 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int) (v_ArrVal_6396 Int)) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_arrayElimArr_2))) (let ((.cse7 (select (select .cse12 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11))) (let ((.cse1 (let ((.cse13 (store (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store (store (store (store .cse4 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| v_ArrVal_6396) .cse6 v_ArrVal_6400) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_6401) .cse5 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse7 v_ArrVal_6407))) (store .cse13 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse13 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)))) (.cse8 (let ((.cse10 (store .cse12 .cse7 v_ArrVal_6406))) (store .cse10 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse10 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))))) (let ((.cse2 (select (select .cse8 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse9)) (.cse3 (+ (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse9) 12))) (or (< .cse0 v_ArrVal_6393) (< v_ArrVal_6393 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (< (select (select .cse1 .cse2) .cse3) .cse3) (< (select (store (store (store (store .cse4 .cse5 v_ArrVal_6393) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| v_ArrVal_6396) .cse6 v_ArrVal_6400) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_6401) .cse5) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse7) (not (= .cse2 (select (select .cse8 .cse2) .cse3))))))))) (forall ((v_ArrVal_6393 Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_6401 Int) (v_ArrVal_6407 (Array Int Int)) (v_ArrVal_6400 Int) (v_ArrVal_6406 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int) (v_ArrVal_6396 Int)) (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_arrayElimArr_1))) (let ((.cse18 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store (store (store (store .cse4 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| v_ArrVal_6396) .cse6 v_ArrVal_6400) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_6401) .cse5 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4)))) (.cse21 (select (select .cse20 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11))) (let ((.cse17 (let ((.cse22 (store .cse18 .cse21 v_ArrVal_6407))) (store .cse22 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse22 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)))) (.cse15 (let ((.cse19 (store .cse20 .cse21 v_ArrVal_6406))) (store .cse19 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse19 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))))) (let ((.cse14 (select (select .cse15 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse9)) (.cse16 (+ (select (select .cse17 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse9) 12))) (or (< .cse0 v_ArrVal_6393) (not (= .cse14 (select (select .cse15 .cse14) .cse16))) (< v_ArrVal_6393 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (< (select (store (store (store (store .cse4 .cse5 v_ArrVal_6393) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| v_ArrVal_6396) .cse6 v_ArrVal_6400) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_6401) .cse5) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (< (select (select .cse17 .cse14) .cse16) .cse16) (= (select (select .cse18 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))))))))) is different from false [2023-11-21 21:37:31,543 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.offset| 4)) (.cse9 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse11 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse5 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base|)) (.cse7 (+ |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.offset| 16)) (.cse6 (+ |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.offset| 12))) (and (forall ((v_ArrVal_6393 Int) (v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_6401 Int) (v_ArrVal_6407 (Array Int Int)) (v_ArrVal_6400 Int) (v_ArrVal_6406 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int) (v_ArrVal_6396 Int)) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| v_arrayElimArr_2))) (let ((.cse0 (select (select .cse12 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11))) (let ((.cse1 (let ((.cse13 (store (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| (store (store (store (store .cse5 |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.offset| v_ArrVal_6396) .cse7 v_ArrVal_6400) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_6401) .cse6 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse0 v_ArrVal_6407))) (store .cse13 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse13 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11 |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.offset|)))) (.cse4 (let ((.cse10 (store .cse12 .cse0 v_ArrVal_6406))) (store .cse10 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse10 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11 |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base|))))) (let ((.cse2 (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse9)) (.cse3 (+ (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse9) 12))) (or (< v_ArrVal_6393 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (= .cse0 |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base|) (< (select (select .cse1 .cse2) .cse3) .cse3) (not (= .cse2 (select (select .cse4 .cse2) .cse3))) (< (select (store (store (store (store .cse5 .cse6 v_ArrVal_6393) |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.offset| v_ArrVal_6396) .cse7 v_ArrVal_6400) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_6401) .cse6) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (< .cse8 v_ArrVal_6393))))))) (forall ((v_ArrVal_6393 Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_6401 Int) (v_ArrVal_6407 (Array Int Int)) (v_ArrVal_6400 Int) (v_ArrVal_6406 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int) (v_ArrVal_6396 Int)) (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| v_arrayElimArr_1))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| (store (store (store (store .cse5 |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.offset| v_ArrVal_6396) .cse7 v_ArrVal_6400) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_6401) .cse6 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4)))) (.cse21 (select (select .cse20 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11))) (let ((.cse18 (let ((.cse22 (store .cse17 .cse21 v_ArrVal_6407))) (store .cse22 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse22 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11 |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.offset|)))) (.cse14 (let ((.cse19 (store .cse20 .cse21 v_ArrVal_6406))) (store .cse19 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse19 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11 |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base|))))) (let ((.cse15 (select (select .cse14 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse9)) (.cse16 (+ (select (select .cse18 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse9) 12))) (or (not (= (select (select .cse14 .cse15) .cse16) .cse15)) (= |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.offset| (select (select .cse17 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11)) (< v_ArrVal_6393 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (< (select (select .cse18 .cse15) .cse16) .cse16) (< (select (store (store (store (store .cse5 .cse6 v_ArrVal_6393) |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.offset| v_ArrVal_6396) .cse7 v_ArrVal_6400) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_6401) .cse6) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (< .cse8 v_ArrVal_6393))))))))) is different from false [2023-11-21 21:37:31,830 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.offset| 4)) (.cse9 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse11 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse5 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base|)) (.cse7 (+ |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.offset| 16)) (.cse6 (+ |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.offset| 12))) (and (forall ((v_ArrVal_6393 Int) (v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_6401 Int) (v_ArrVal_6407 (Array Int Int)) (v_ArrVal_6400 Int) (v_ArrVal_6406 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int) (v_ArrVal_6396 Int)) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base| v_arrayElimArr_2))) (let ((.cse4 (select (select .cse13 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11))) (let ((.cse8 (let ((.cse12 (store .cse13 .cse4 v_ArrVal_6406))) (store .cse12 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse12 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11 |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base|)))) (.cse0 (let ((.cse10 (store (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base| (store (store (store (store .cse5 |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.offset| v_ArrVal_6396) .cse7 v_ArrVal_6400) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_6401) .cse6 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse4 v_ArrVal_6407))) (store .cse10 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse10 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11 |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.offset|))))) (let ((.cse2 (+ 12 (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse9))) (.cse1 (select (select .cse8 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse9))) (or (< (select (select .cse0 .cse1) .cse2) .cse2) (< .cse3 v_ArrVal_6393) (< v_ArrVal_6393 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (= |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base| .cse4) (< (select (store (store (store (store .cse5 .cse6 v_ArrVal_6393) |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.offset| v_ArrVal_6396) .cse7 v_ArrVal_6400) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_6401) .cse6) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (not (= (select (select .cse8 .cse1) .cse2) .cse1)))))))) (forall ((v_ArrVal_6393 Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_6401 Int) (v_ArrVal_6407 (Array Int Int)) (v_ArrVal_6400 Int) (v_ArrVal_6406 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int) (v_ArrVal_6396 Int)) (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base| v_arrayElimArr_1))) (let ((.cse18 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base| (store (store (store (store .cse5 |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.offset| v_ArrVal_6396) .cse7 v_ArrVal_6400) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_6401) .cse6 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4)))) (.cse21 (select (select .cse20 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11))) (let ((.cse17 (let ((.cse22 (store .cse18 .cse21 v_ArrVal_6407))) (store .cse22 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse22 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11 |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.offset|)))) (.cse14 (let ((.cse19 (store .cse20 .cse21 v_ArrVal_6406))) (store .cse19 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse19 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11 |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base|))))) (let ((.cse15 (select (select .cse14 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse9)) (.cse16 (+ 12 (select (select .cse17 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse9)))) (or (not (= (select (select .cse14 .cse15) .cse16) .cse15)) (< (select (select .cse17 .cse15) .cse16) .cse16) (< .cse3 v_ArrVal_6393) (< v_ArrVal_6393 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (= |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.offset| (select (select .cse18 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11)) (< (select (store (store (store (store .cse5 .cse6 v_ArrVal_6393) |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.offset| v_ArrVal_6396) .cse7 v_ArrVal_6400) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_6401) .cse6) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|))))))))) is different from false [2023-11-21 21:37:33,925 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse8 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (and (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26| Int)) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26| 1)) (forall ((v_ArrVal_6393 Int) (v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_6401 Int) (v_ArrVal_6407 (Array Int Int)) (v_ArrVal_6400 Int) (v_ArrVal_6406 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int) (v_ArrVal_6396 Int)) (let ((.cse9 (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26| v_arrayElimArr_2))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26|)) (.cse0 (select (select .cse9 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8))) (let ((.cse5 (let ((.cse10 (store (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26| (store (store (store (store .cse1 0 v_ArrVal_6396) 16 v_ArrVal_6400) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_6401) 12 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse0 v_ArrVal_6407))) (store .cse10 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse10 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 0)))) (.cse2 (let ((.cse7 (store .cse9 .cse0 v_ArrVal_6406))) (store .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26|))))) (let ((.cse3 (select (select .cse2 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse6)) (.cse4 (+ 12 (select (select .cse5 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse6)))) (or (< 4 v_ArrVal_6393) (< v_ArrVal_6393 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (= |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26| .cse0) (< (select (store (store (store (store .cse1 12 v_ArrVal_6393) 0 v_ArrVal_6396) 16 v_ArrVal_6400) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_6401) 12) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (not (= (select (select .cse2 .cse3) .cse4) .cse3)) (< (select (select .cse5 .cse3) .cse4) .cse4))))))))) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26| Int)) (or (forall ((v_ArrVal_6393 Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_6401 Int) (v_ArrVal_6407 (Array Int Int)) (v_ArrVal_6400 Int) (v_ArrVal_6406 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int) (v_ArrVal_6396 Int)) (let ((.cse18 (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26| v_arrayElimArr_1)) (.cse16 (select |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26|))) (let ((.cse14 (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26| (store (store (store (store .cse16 0 v_ArrVal_6396) 16 v_ArrVal_6400) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_6401) 12 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4)))) (.cse19 (select (select .cse18 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8))) (let ((.cse15 (let ((.cse20 (store .cse14 .cse19 v_ArrVal_6407))) (store .cse20 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse20 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 0)))) (.cse11 (let ((.cse17 (store .cse18 .cse19 v_ArrVal_6406))) (store .cse17 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse17 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26|))))) (let ((.cse12 (select (select .cse11 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse6)) (.cse13 (+ (select (select .cse15 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse6) 12))) (or (not (= (select (select .cse11 .cse12) .cse13) .cse12)) (< 4 v_ArrVal_6393) (< v_ArrVal_6393 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (= (select (select .cse14 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8) 0) (< (select (select .cse15 .cse12) .cse13) .cse13) (< (select (store (store (store (store .cse16 12 v_ArrVal_6393) 0 v_ArrVal_6396) 16 v_ArrVal_6400) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_6401) 12) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|))))))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26| 1)))))) is different from false [2023-11-21 21:37:38,256 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse8 (+ |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.offset| 4))) (and (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26| Int)) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26| 1)) (forall ((v_ArrVal_6393 Int) (v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_6401 Int) (v_ArrVal_6407 (Array Int Int)) (v_ArrVal_6400 Int) (v_ArrVal_6406 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int) (v_ArrVal_6396 Int)) (let ((.cse9 (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26| v_arrayElimArr_2))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26|)) (.cse0 (select (select .cse9 |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) .cse8))) (let ((.cse2 (let ((.cse10 (store (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26| (store (store (store (store .cse1 0 v_ArrVal_6396) 16 v_ArrVal_6400) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_6401) 12 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse0 v_ArrVal_6407))) (store .cse10 |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base| (store (select .cse10 |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) .cse8 0)))) (.cse5 (let ((.cse7 (store .cse9 .cse0 v_ArrVal_6406))) (store .cse7 |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base| (store (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) .cse8 |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26|))))) (let ((.cse3 (select (select .cse5 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse6)) (.cse4 (+ (select (select .cse2 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse6) 12))) (or (= .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26|) (< 4 v_ArrVal_6393) (< v_ArrVal_6393 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (< (select (store (store (store (store .cse1 12 v_ArrVal_6393) 0 v_ArrVal_6396) 16 v_ArrVal_6400) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_6401) 12) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (< (select (select .cse2 .cse3) .cse4) .cse4) (not (= .cse3 (select (select .cse5 .cse3) .cse4))))))))))) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26| Int)) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26| 1)) (forall ((v_ArrVal_6393 Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_6401 Int) (v_ArrVal_6407 (Array Int Int)) (v_ArrVal_6400 Int) (v_ArrVal_6406 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int) (v_ArrVal_6396 Int)) (let ((.cse20 (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26| v_arrayElimArr_1)) (.cse15 (select |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26|))) (let ((.cse11 (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26| (store (store (store (store .cse15 0 v_ArrVal_6396) 16 v_ArrVal_6400) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_6401) 12 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4)))) (.cse18 (select (select .cse20 |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) .cse8))) (let ((.cse16 (let ((.cse19 (store .cse20 .cse18 v_ArrVal_6406))) (store .cse19 |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base| (store (select .cse19 |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) .cse8 |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26|)))) (.cse12 (let ((.cse17 (store .cse11 .cse18 v_ArrVal_6407))) (store .cse17 |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base| (store (select .cse17 |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) .cse8 0))))) (let ((.cse14 (+ 12 (select (select .cse12 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse6))) (.cse13 (select (select .cse16 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse6))) (or (= (select (select .cse11 |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) .cse8) 0) (< 4 v_ArrVal_6393) (< v_ArrVal_6393 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (< (select (select .cse12 .cse13) .cse14) .cse14) (< (select (store (store (store (store .cse15 12 v_ArrVal_6393) 0 v_ArrVal_6396) 16 v_ArrVal_6400) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_6401) 12) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (not (= (select (select .cse16 .cse13) .cse14) .cse13)))))))))))) is different from false [2023-11-21 21:37:40,389 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26| Int)) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26| 1)) (forall ((v_ArrVal_6393 Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_6401 Int) (v_ArrVal_6407 (Array Int Int)) (v_ArrVal_6400 Int) (v_ArrVal_6406 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int) (v_ArrVal_6396 Int)) (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26| v_arrayElimArr_1)) (.cse1 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse6 (select |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26|))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26| (store (store (store (store .cse6 0 v_ArrVal_6396) 16 v_ArrVal_6400) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_6401) 12 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4)))) (.cse3 (select (select .cse5 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse1))) (or (= (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse1) 0) (< 4 v_ArrVal_6393) (< (select (select (let ((.cse2 (store .cse0 .cse3 v_ArrVal_6407))) (store .cse2 |c_pusherThread1of1ForFork0_~q~0#1.base| (store (select .cse2 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse1 0))) |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26|) 12) 12) (< v_ArrVal_6393 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (not (= |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26| (select (select (let ((.cse4 (store .cse5 .cse3 v_ArrVal_6406))) (store .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base| (store (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse1 |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26|))) |v_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base_26|) 12))) (< (select (store (store (store (store .cse6 12 v_ArrVal_6393) 0 v_ArrVal_6396) 16 v_ArrVal_6400) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_6401) 12) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|))))))) is different from false [2023-11-21 21:37:40,880 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:37:40,881 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:37:41,233 INFO L349 Elim1Store]: treesize reduction 359, result has 32.4 percent of original size [2023-11-21 21:37:41,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 199006 treesize of output 197567 [2023-11-21 21:37:42,033 INFO L349 Elim1Store]: treesize reduction 40, result has 50.0 percent of original size [2023-11-21 21:37:42,034 INFO L378 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 6 case distinctions, treesize of input 2016 treesize of output 1913 [2023-11-21 21:37:42,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:37:42,129 INFO L378 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 1 case distinctions, treesize of input 408 treesize of output 278 [2023-11-21 21:37:42,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:37:42,217 INFO L378 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 73 treesize of output 89 [2023-11-21 21:37:42,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:37:42,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1976 treesize of output 1902 [2023-11-21 21:37:42,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 212 treesize of output 204 [2023-11-21 21:37:42,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:37:42,511 INFO L378 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 388 treesize of output 340 [2023-11-21 21:37:42,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 162 treesize of output 154 [2023-11-21 21:37:42,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 4 [2023-11-21 21:37:42,938 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:37:42,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 4 [2023-11-21 21:37:43,171 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:37:43,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 12 [2023-11-21 21:37:43,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 4 [2023-11-21 21:37:43,241 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:37:43,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:37:43,262 INFO L378 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 29 treesize of output 29 [2023-11-21 21:37:43,346 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:37:43,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:37:43,364 INFO L378 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 47 treesize of output 47 [2023-11-21 21:37:43,563 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:37:43,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:37:43,573 INFO L378 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 56 treesize of output 52 [2023-11-21 21:37:43,679 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:37:43,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 12 [2023-11-21 21:37:44,772 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:37:44,772 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:37:44,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:37:44,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 209 treesize of output 273 [2023-11-21 21:37:45,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:37:45,980 INFO L378 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 91 treesize of output 87 [2023-11-21 21:37:51,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1755 backedges. 466 proven. 618 refuted. 115 times theorem prover too weak. 324 trivial. 232 not checked. [2023-11-21 21:37:51,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756053641] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 21:37:51,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 21:37:51,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 39, 40] total 123 [2023-11-21 21:37:51,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291840243] [2023-11-21 21:37:51,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 21:37:51,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 123 states [2023-11-21 21:37:51,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:37:51,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2023-11-21 21:37:51,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=573, Invalid=12351, Unknown=218, NotChecked=1864, Total=15006 [2023-11-21 21:37:51,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:37:51,438 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:37:51,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 123 states, 123 states have (on average 12.83739837398374) internal successors, (1579), 123 states have internal predecessors, (1579), 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) [2023-11-21 21:37:51,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:37:51,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:37:51,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:37:51,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:37:51,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:37:51,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:37:51,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:37:51,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:37:51,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:37:51,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:37:51,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:37:51,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-11-21 21:37:51,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-21 21:37:51,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-11-21 21:37:51,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:38:36,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:38:36,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:38:36,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:38:36,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:38:36,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:38:36,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:38:36,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:38:36,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:38:36,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:38:36,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:38:36,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:38:36,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-21 21:38:36,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-21 21:38:36,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-11-21 21:38:36,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-11-21 21:38:36,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-21 21:38:37,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-21 21:38:37,116 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting pusherErr14ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-21 21:38:37,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:38:37,117 INFO L85 PathProgramCache]: Analyzing trace with hash 879138724, now seen corresponding path program 1 times [2023-11-21 21:38:37,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:38:37,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840562872] [2023-11-21 21:38:37,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:38:37,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms Killed by 15