./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-divine/divinefifo_1w1r.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ed4a9-82ec-4ee5-8b79-1eadb774ac72/bin/ugemcutter-verify-v6A4Riy6iL/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ed4a9-82ec-4ee5-8b79-1eadb774ac72/bin/ugemcutter-verify-v6A4Riy6iL/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ed4a9-82ec-4ee5-8b79-1eadb774ac72/bin/ugemcutter-verify-v6A4Riy6iL/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ed4a9-82ec-4ee5-8b79-1eadb774ac72/bin/ugemcutter-verify-v6A4Riy6iL/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread-divine/divinefifo_1w1r.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ed4a9-82ec-4ee5-8b79-1eadb774ac72/bin/ugemcutter-verify-v6A4Riy6iL/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ed4a9-82ec-4ee5-8b79-1eadb774ac72/bin/ugemcutter-verify-v6A4Riy6iL --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.5-dev-a016563 [2024-11-08 12:01:35,836 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 12:01:35,912 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ed4a9-82ec-4ee5-8b79-1eadb774ac72/bin/ugemcutter-verify-v6A4Riy6iL/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2024-11-08 12:01:35,920 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 12:01:35,920 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 12:01:35,971 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 12:01:35,972 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 12:01:35,973 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 12:01:35,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 12:01:35,976 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 12:01:35,979 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 12:01:35,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 12:01:35,980 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 12:01:35,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 12:01:35,981 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 12:01:35,981 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 12:01:35,982 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 12:01:35,982 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 12:01:35,983 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 12:01:35,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 12:01:35,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 12:01:35,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 12:01:35,989 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-08 12:01:35,989 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 12:01:35,991 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 12:01:35,992 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 12:01:35,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 12:01:35,993 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 12:01:35,994 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 12:01:35,995 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 12:01:35,995 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-08 12:01:35,996 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 12:01:35,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-08 12:01:35,997 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 12:01:35,998 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 12:01:35,998 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 12:01:35,999 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 12:01:35,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 12:01:36,000 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 12:01:36,000 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-11-08 12:01:36,000 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-08 12:01:36,001 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-08 12:01:36,001 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-08 12:01:36,001 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ed4a9-82ec-4ee5-8b79-1eadb774ac72/bin/ugemcutter-verify-v6A4Riy6iL/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ed4a9-82ec-4ee5-8b79-1eadb774ac72/bin/ugemcutter-verify-v6A4Riy6iL 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 [2024-11-08 12:01:36,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 12:01:36,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 12:01:36,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 12:01:36,380 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 12:01:36,380 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 12:01:36,382 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ed4a9-82ec-4ee5-8b79-1eadb774ac72/bin/ugemcutter-verify-v6A4Riy6iL/../../sv-benchmarks/c/pthread-divine/divinefifo_1w1r.i Unable to find full path for "g++" [2024-11-08 12:01:38,747 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 12:01:39,106 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 12:01:39,106 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ed4a9-82ec-4ee5-8b79-1eadb774ac72/sv-benchmarks/c/pthread-divine/divinefifo_1w1r.i [2024-11-08 12:01:39,136 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ed4a9-82ec-4ee5-8b79-1eadb774ac72/bin/ugemcutter-verify-v6A4Riy6iL/data/4da3772bd/52dacf7fd87d4e9394c390b9e3cd8e4e/FLAG6081f0c0f [2024-11-08 12:01:39,162 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ed4a9-82ec-4ee5-8b79-1eadb774ac72/bin/ugemcutter-verify-v6A4Riy6iL/data/4da3772bd/52dacf7fd87d4e9394c390b9e3cd8e4e [2024-11-08 12:01:39,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 12:01:39,168 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 12:01:39,170 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 12:01:39,170 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 12:01:39,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 12:01:39,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:01:39" (1/1) ... [2024-11-08 12:01:39,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4795a489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:01:39, skipping insertion in model container [2024-11-08 12:01:39,183 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:01:39" (1/1) ... [2024-11-08 12:01:39,280 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 12:01:40,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:01:40,159 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 12:01:40,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:01:40,364 INFO L204 MainTranslator]: Completed translation [2024-11-08 12:01:40,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:01:40 WrapperNode [2024-11-08 12:01:40,365 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 12:01:40,367 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 12:01:40,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 12:01:40,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 12:01:40,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:01:40" (1/1) ... [2024-11-08 12:01:40,436 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:01:40" (1/1) ... [2024-11-08 12:01:40,536 INFO L138 Inliner]: procedures = 277, calls = 104, calls flagged for inlining = 27, calls inlined = 29, statements flattened = 974 [2024-11-08 12:01:40,536 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 12:01:40,537 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 12:01:40,538 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 12:01:40,538 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 12:01:40,558 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:01:40" (1/1) ... [2024-11-08 12:01:40,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:01:40" (1/1) ... [2024-11-08 12:01:40,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:01:40" (1/1) ... [2024-11-08 12:01:40,595 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:01:40" (1/1) ... [2024-11-08 12:01:40,688 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:01:40" (1/1) ... [2024-11-08 12:01:40,702 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:01:40" (1/1) ... [2024-11-08 12:01:40,711 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:01:40" (1/1) ... [2024-11-08 12:01:40,717 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:01:40" (1/1) ... [2024-11-08 12:01:40,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 12:01:40,729 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 12:01:40,730 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 12:01:40,730 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 12:01:40,731 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:01:40" (1/1) ... [2024-11-08 12:01:40,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-08 12:01:40,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ed4a9-82ec-4ee5-8b79-1eadb774ac72/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:01:40,775 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ed4a9-82ec-4ee5-8b79-1eadb774ac72/bin/ugemcutter-verify-v6A4Riy6iL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-08 12:01:40,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ed4a9-82ec-4ee5-8b79-1eadb774ac72/bin/ugemcutter-verify-v6A4Riy6iL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-08 12:01:40,808 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2024-11-08 12:01:40,808 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2024-11-08 12:01:40,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 12:01:40,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-08 12:01:40,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 12:01:40,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 12:01:40,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 12:01:40,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 12:01:40,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 12:01:40,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-08 12:01:40,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 12:01:40,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 12:01:40,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 12:01:40,813 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 12:01:41,104 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 12:01:41,107 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 12:01:43,217 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 12:01:43,217 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 12:01:43,259 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 12:01:43,259 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 12:01:43,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:01:43 BoogieIcfgContainer [2024-11-08 12:01:43,260 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 12:01:43,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 12:01:43,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 12:01:43,266 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 12:01:43,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 12:01:39" (1/3) ... [2024-11-08 12:01:43,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5077010 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:01:43, skipping insertion in model container [2024-11-08 12:01:43,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:01:40" (2/3) ... [2024-11-08 12:01:43,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5077010 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:01:43, skipping insertion in model container [2024-11-08 12:01:43,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:01:43" (3/3) ... [2024-11-08 12:01:43,269 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.i [2024-11-08 12:01:43,287 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 12:01:43,288 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 96 error locations. [2024-11-08 12:01:43,288 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 12:01:43,495 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-08 12:01:43,595 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:43,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-08 12:01:43,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ed4a9-82ec-4ee5-8b79-1eadb774ac72/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:01:43,598 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ed4a9-82ec-4ee5-8b79-1eadb774ac72/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-08 12:01:43,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ed4a9-82ec-4ee5-8b79-1eadb774ac72/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-08 12:01:43,657 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:43,676 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == pusherThread1of1ForFork0 ======== [2024-11-08 12:01:43,684 INFO L333 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, 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;@551d1612, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:43,685 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-08 12:01:44,802 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting pusherErr0ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-08 12:01:44,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:44,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1046223367, now seen corresponding path program 1 times [2024-11-08 12:01:44,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:44,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075313329] [2024-11-08 12:01:44,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:44,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:45,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:45,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:45,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075313329] [2024-11-08 12:01:45,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075313329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:45,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:45,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:45,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849102747] [2024-11-08 12:01:45,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:45,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 12:01:45,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:45,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 12:01:45,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 12:01:45,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:45,610 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:45,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 78.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:01:45,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:45,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:45,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 12:01:45,733 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting pusherErr0ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-08 12:01:45,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:45,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1228161080, now seen corresponding path program 1 times [2024-11-08 12:01:45,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:45,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817376517] [2024-11-08 12:01:45,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:45,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:47,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:47,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:47,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817376517] [2024-11-08 12:01:47,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817376517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:47,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:47,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:01:47,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034953894] [2024-11-08 12:01:47,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:47,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 12:01:47,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:47,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 12:01:47,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 12:01:47,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:47,491 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:47,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 30.6) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:01:47,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:47,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:49,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:49,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:49,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 12:01:49,077 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting pusherErr1ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-08 12:01:49,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:49,077 INFO L85 PathProgramCache]: Analyzing trace with hash -251542308, now seen corresponding path program 1 times [2024-11-08 12:01:49,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:49,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532620309] [2024-11-08 12:01:49,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:49,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:50,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:50,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:50,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532620309] [2024-11-08 12:01:50,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532620309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:50,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:50,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:01:50,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70579477] [2024-11-08 12:01:50,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:50,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 12:01:50,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:50,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 12:01:50,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 12:01:50,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:50,452 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:50,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 31.8) internal successors, (159), 6 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:01:50,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:50,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:50,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:52,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:52,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:52,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:52,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 12:01:52,065 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting pusherErr3ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-08 12:01:52,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:52,067 INFO L85 PathProgramCache]: Analyzing trace with hash -839543151, now seen corresponding path program 1 times [2024-11-08 12:01:52,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:52,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869124458] [2024-11-08 12:01:52,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:52,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:53,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:53,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:53,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869124458] [2024-11-08 12:01:53,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869124458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:53,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:53,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:01:53,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249852859] [2024-11-08 12:01:53,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:53,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 12:01:53,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:53,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 12:01:53,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 12:01:53,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:53,288 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:53,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 36.2) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:01:53,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:53,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:53,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:53,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:54,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:54,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:54,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:54,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:54,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 12:01:54,012 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting pusherErr4ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-08 12:01:54,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:54,013 INFO L85 PathProgramCache]: Analyzing trace with hash 85323469, now seen corresponding path program 1 times [2024-11-08 12:01:54,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:54,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634504413] [2024-11-08 12:01:54,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:54,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:55,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:55,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:55,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634504413] [2024-11-08 12:01:55,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634504413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:55,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:55,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:01:55,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021081841] [2024-11-08 12:01:55,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:55,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 12:01:55,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:55,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 12:01:55,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 12:01:55,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:55,087 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:55,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 37.6) internal successors, (188), 6 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:01:55,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:55,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:55,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:55,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:55,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:55,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:55,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:55,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:55,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:55,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:55,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 12:01:55,607 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting pusherErr5ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-08 12:01:55,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:55,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1857826845, now seen corresponding path program 1 times [2024-11-08 12:01:55,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:55,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338616212] [2024-11-08 12:01:55,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:55,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:56,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:56,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:56,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338616212] [2024-11-08 12:01:56,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338616212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:56,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:56,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:01:56,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728636626] [2024-11-08 12:01:56,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:56,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 12:01:56,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:56,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 12:01:56,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 12:01:56,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:56,702 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:56,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 39.4) internal successors, (197), 6 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:01:56,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:56,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:56,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:56,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:56,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:56,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:57,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:57,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:57,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:57,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:57,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:57,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:57,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 12:01:57,874 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting pusherErr7ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-08 12:01:57,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:57,875 INFO L85 PathProgramCache]: Analyzing trace with hash -461376912, now seen corresponding path program 1 times [2024-11-08 12:01:57,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:57,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32409580] [2024-11-08 12:01:57,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:57,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:58,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:58,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:58,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32409580] [2024-11-08 12:01:58,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32409580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:58,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:58,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:01:58,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523176419] [2024-11-08 12:01:58,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:58,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 12:01:58,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:58,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 12:01:58,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 12:01:58,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:58,933 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:58,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 41.8) internal successors, (209), 6 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:01:58,934 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:58,934 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:58,934 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:58,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:58,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:58,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:58,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:59,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:59,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:59,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:59,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:59,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:59,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:59,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:01:59,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 12:01:59,787 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting pusherErr8ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-08 12:01:59,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:59,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1068994478, now seen corresponding path program 1 times [2024-11-08 12:01:59,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:59,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868236838] [2024-11-08 12:01:59,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:59,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:02:01,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:02:01,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:02:01,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868236838] [2024-11-08 12:02:01,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868236838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:02:01,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:02:01,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:02:01,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609005198] [2024-11-08 12:02:01,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:02:01,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 12:02:01,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:02:01,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 12:02:01,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 12:02:01,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:01,020 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:02:01,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 43.2) internal successors, (216), 6 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:02:01,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:01,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:01,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:01,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:01,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:01,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:01,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:01,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:02,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:02,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:02,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:02,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:02,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:02,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:02,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:02,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:02,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 12:02:02,166 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting pusherErr10ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-08 12:02:02,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:02:02,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1420514884, now seen corresponding path program 1 times [2024-11-08 12:02:02,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:02:02,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35793079] [2024-11-08 12:02:02,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:02:02,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:02:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:02:03,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:02:03,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:02:03,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35793079] [2024-11-08 12:02:03,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35793079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:02:03,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:02:03,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:02:03,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448254864] [2024-11-08 12:02:03,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:02:03,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 12:02:03,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:02:03,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 12:02:03,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 12:02:03,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:03,750 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:02:03,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 46.4) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:02:03,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:03,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:03,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:03,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:03,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:03,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:03,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:03,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:03,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:05,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:05,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:05,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:05,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:05,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:05,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:05,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:05,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:05,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:05,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 12:02:05,702 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting pusherErr13ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-08 12:02:05,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:02:05,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1551198516, now seen corresponding path program 1 times [2024-11-08 12:02:05,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:02:05,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342597098] [2024-11-08 12:02:05,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:02:05,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:02:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:02:07,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:02:07,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:02:07,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342597098] [2024-11-08 12:02:07,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342597098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:02:07,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:02:07,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:02:07,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602135113] [2024-11-08 12:02:07,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:02:07,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 12:02:07,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:02:07,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 12:02:07,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 12:02:07,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:07,142 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:02:07,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 51.2) internal successors, (256), 6 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:02:07,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:07,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:07,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:07,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:07,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:07,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:07,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:07,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:07,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:07,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:08,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:08,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:08,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:08,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:08,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:08,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:08,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:08,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:08,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:08,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:08,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 12:02:08,222 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting pusherErr14ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-08 12:02:08,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:02:08,222 INFO L85 PathProgramCache]: Analyzing trace with hash -850149986, now seen corresponding path program 1 times [2024-11-08 12:02:08,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:02:08,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114208737] [2024-11-08 12:02:08,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:02:08,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:02:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:02:09,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:02:09,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:02:09,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114208737] [2024-11-08 12:02:09,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114208737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:02:09,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:02:09,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:02:09,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5507287] [2024-11-08 12:02:09,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:02:09,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 12:02:09,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:02:09,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 12:02:09,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 12:02:09,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:09,678 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:02:09,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 53.0) internal successors, (265), 6 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:02:09,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:09,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:09,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:09,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:09,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:09,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:09,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:09,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:09,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:09,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:09,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:10,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:10,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:10,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:10,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:10,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:10,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:10,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:10,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:10,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:10,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:10,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:10,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 12:02:10,897 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting pusherErr14ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-08 12:02:10,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:02:10,898 INFO L85 PathProgramCache]: Analyzing trace with hash 970187088, now seen corresponding path program 1 times [2024-11-08 12:02:10,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:02:10,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786433234] [2024-11-08 12:02:10,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:02:10,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:02:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:02:11,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:02:11,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:02:11,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786433234] [2024-11-08 12:02:11,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786433234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:02:11,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:02:11,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:02:11,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359292301] [2024-11-08 12:02:11,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:02:11,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:02:11,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:02:11,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:02:11,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:02:11,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:11,198 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:02:11,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:02:11,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:11,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:11,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:11,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:11,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:11,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:11,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:11,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:11,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:11,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:11,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:11,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:11,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:11,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:11,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:11,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:11,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:11,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:11,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:11,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:11,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:11,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:11,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:11,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:02:11,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 12:02:11,702 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting pusherErr14ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-08 12:02:11,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:02:11,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1620066264, now seen corresponding path program 1 times [2024-11-08 12:02:11,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:02:11,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919139215] [2024-11-08 12:02:11,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:02:11,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:02:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:02:15,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:02:15,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:02:15,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919139215] [2024-11-08 12:02:15,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919139215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:02:15,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:02:15,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 12:02:15,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682182456] [2024-11-08 12:02:15,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:02:15,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 12:02:15,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:02:15,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 12:02:15,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-11-08 12:02:15,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:15,481 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:02:15,482 INFO L472 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) [2024-11-08 12:02:15,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:15,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:15,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:15,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:15,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:15,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:15,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:15,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:15,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:15,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:15,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:15,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:02:15,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:24,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:24,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:24,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:24,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:24,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:24,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:24,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:02:24,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 12:02:24,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 12:02:24,983 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting pusherErr14ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-08 12:02:24,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:02:24,984 INFO L85 PathProgramCache]: Analyzing trace with hash -822375386, now seen corresponding path program 1 times [2024-11-08 12:02:24,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:02:24,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751936954] [2024-11-08 12:02:24,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:02:24,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:02:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:02:29,441 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:02:29,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:02:29,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751936954] [2024-11-08 12:02:29,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751936954] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:02:29,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25504302] [2024-11-08 12:02:29,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:02:29,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:02:29,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ed4a9-82ec-4ee5-8b79-1eadb774ac72/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:02:29,450 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ed4a9-82ec-4ee5-8b79-1eadb774ac72/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:02:29,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ed4a9-82ec-4ee5-8b79-1eadb774ac72/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 12:02:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:02:30,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 1616 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-08 12:02:30,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:02:32,057 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 [2024-11-08 12:02:32,107 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 [2024-11-08 12:02:32,169 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 [2024-11-08 12:02:32,244 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 [2024-11-08 12:02:32,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:02:32,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:02:32,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:02:32,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:02:32,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:02:32,356 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 [2024-11-08 12:02:32,465 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:02:32,465 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:02:37,419 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:02:37,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25504302] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:02:37,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:02:37,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 45 [2024-11-08 12:02:37,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336605772] [2024-11-08 12:02:37,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:02:37,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-08 12:02:37,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:02:37,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-08 12:02:37,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1876, Unknown=0, NotChecked=0, Total=2070 [2024-11-08 12:02:37,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:37,429 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:02:37,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 24.31111111111111) internal successors, (1094), 46 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:02:37,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:37,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:37,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:37,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:37,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:37,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:37,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:37,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:37,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:37,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:37,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:37,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:02:37,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-08 12:02:37,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:52,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:52,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:52,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:52,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:52,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:52,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:52,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:52,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:52,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:52,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:52,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:02:52,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:02:52,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 12:02:52,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:02:52,789 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ed4a9-82ec-4ee5-8b79-1eadb774ac72/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 12:02:52,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ed4a9-82ec-4ee5-8b79-1eadb774ac72/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-08 12:02:52,968 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting pusherErr14ASSERT_VIOLATIONDATA_RACE === [pusherErr0ASSERT_VIOLATIONDATA_RACE, pusherErr1ASSERT_VIOLATIONDATA_RACE, pusherErr2ASSERT_VIOLATIONDATA_RACE, pusherErr6ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-08 12:02:52,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:02:52,969 INFO L85 PathProgramCache]: Analyzing trace with hash -512908926, now seen corresponding path program 1 times [2024-11-08 12:02:52,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:02:52,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713199674] [2024-11-08 12:02:52,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:02:52,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:03:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:03:23,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1286 backedges. 774 proven. 183 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2024-11-08 12:03:23,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:03:23,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713199674] [2024-11-08 12:03:23,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713199674] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:03:23,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484379630] [2024-11-08 12:03:23,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:03:23,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:03:23,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ed4a9-82ec-4ee5-8b79-1eadb774ac72/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:03:23,550 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ed4a9-82ec-4ee5-8b79-1eadb774ac72/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:03:23,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b60ed4a9-82ec-4ee5-8b79-1eadb774ac72/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 12:03:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:03:24,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 3254 conjuncts, 182 conjuncts are in the unsatisfiable core [2024-11-08 12:03:24,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:03:26,556 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 [2024-11-08 12:03:26,706 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 [2024-11-08 12:03:26,815 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 [2024-11-08 12:03:27,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:03:27,412 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 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 12:03:28,013 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 [2024-11-08 12:03:28,021 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 [2024-11-08 12:03:29,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:03:29,088 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 [2024-11-08 12:03:29,111 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 [2024-11-08 12:03:29,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:03:29,401 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 [2024-11-08 12:03:29,412 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 [2024-11-08 12:03:29,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:03:29,607 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 [2024-11-08 12:03:29,626 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 [2024-11-08 12:03:30,940 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2024-11-08 12:03:30,941 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 [2024-11-08 12:03:30,948 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 [2024-11-08 12:03:30,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:03:30,968 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-11-08 12:03:30,968 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 [2024-11-08 12:03:31,688 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 8 treesize of output 1 [2024-11-08 12:03:31,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:03:31,707 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 [2024-11-08 12:03:32,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2024-11-08 12:03:33,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:03:33,049 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 12:03:33,049 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 25 treesize of output 27 [2024-11-08 12:03:33,061 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 [2024-11-08 12:03:33,321 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 [2024-11-08 12:03:33,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:03:33,329 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 [2024-11-08 12:03:34,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:03:34,350 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 [2024-11-08 12:03:34,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1286 backedges. 809 proven. 467 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 12:03:34,505 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:03:35,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 124 [2024-11-08 12:03:39,596 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse9 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))) (let ((.cse0 (forall ((v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem38#1.base| v_ArrVal_5403))) (let ((.cse11 (+ (select (select .cse10 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse9) 12))) (< (select (select (store .cse10 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse10 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse4 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) v_arrayElimCell_36) .cse11) .cse11))))) (.cse1 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse2 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (.cse5 (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) (and (or .cse0 .cse1) (or .cse2 .cse0) (or (forall ((v_ArrVal_5403 (Array Int Int))) (< (select (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem38#1.base| v_ArrVal_5403))) (store .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse4 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse5) .cse5)) (not .cse1) (not .cse2)) (forall ((v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem38#1.base| v_ArrVal_5403))) (let ((.cse6 (store .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse4 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))) (or (< (select (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse5) .cse5) (let ((.cse7 (+ (select (select .cse8 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse9) 12))) (< (select (select .cse6 v_arrayElimCell_36) .cse7) .cse7))))))))) is different from false [2024-11-08 12:03:39,923 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse10 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3))) (let ((.cse0 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (.cse1 (forall ((v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_5403))) (let ((.cse12 (+ (select (select .cse11 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse10) 12))) (< (select (select (store .cse11 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse11 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) v_arrayElimCell_36) .cse12) .cse12))))) (.cse6 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse5 (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) (and (or .cse0 .cse1) (or (forall ((v_ArrVal_5403 (Array Int Int))) (< (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_5403))) (store .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse5) .cse5)) (not .cse6) (not .cse0)) (or .cse1 .cse6) (forall ((v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_5403))) (let ((.cse7 (store .cse9 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse9 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))) (or (let ((.cse8 (+ (select (select .cse9 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse10) 12))) (< (select (select .cse7 v_arrayElimCell_36) .cse8) .cse8)) (< (select (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse5) .cse5))))))))) is different from false [2024-11-08 12:03:42,017 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse4 (+ |c_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset| 4)))) (.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse6 (= (select (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) (.cse13 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))) (let ((.cse7 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse8 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (.cse9 (and (or (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse18 (store .cse3 (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) v_ArrVal_5403))) (let ((.cse19 (+ (select (select .cse18 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse13) 12))) (< (select (select (store .cse18 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse18 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) v_arrayElimCell_36) .cse19) .cse19)))) .cse6) (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse22 (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2))) (or (let ((.cse20 (store .cse3 .cse22 v_ArrVal_5403))) (let ((.cse21 (+ (select (select .cse20 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse13) 12))) (< (select (select (store .cse20 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse20 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) v_arrayElimCell_36) .cse21) .cse21))) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse22))))))) (and (or (and (forall ((v_ArrVal_5401 (Array Int Int)) (v_ArrVal_5403 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse0) (< (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_5403))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse4) .cse4)))) (or (forall ((v_ArrVal_5401 (Array Int Int)) (v_ArrVal_5403 (Array Int Int))) (< (select (select (let ((.cse5 (store .cse3 (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) v_ArrVal_5403))) (store .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse4) .cse4)) .cse6)) (not .cse7) (not .cse8)) (or .cse7 .cse9) (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse14 (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2))) (let ((.cse12 (store .cse3 .cse14 v_ArrVal_5403))) (let ((.cse10 (store .cse12 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse12 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))) (or (let ((.cse11 (+ (select (select .cse12 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse13) 12))) (< (select (select .cse10 v_arrayElimCell_36) .cse11) .cse11)) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse14) (< (select (select .cse10 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse4) .cse4)))))) (or .cse8 .cse9) (or (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse17 (store .cse3 (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) v_ArrVal_5403))) (let ((.cse15 (store .cse17 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse17 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))) (or (let ((.cse16 (+ (select (select .cse17 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse13) 12))) (< (select (select .cse15 v_arrayElimCell_36) .cse16) .cse16)) (< (select (select .cse15 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse4) .cse4))))) .cse6)))))) is different from false [2024-11-08 12:03:43,277 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) (.cse5 (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) (let ((.cse0 (select .cse8 .cse5)) (.cse4 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse6 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse14 (and (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (or (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse20 (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse20) (let ((.cse21 (store (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store .cse8 .cse5 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse20 v_ArrVal_5403))) (let ((.cse22 (+ (select (select .cse21 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4) 12))) (< (select (select (store .cse21 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse21 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) v_arrayElimCell_36) .cse22) .cse22)))))))) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse25 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store .cse8 .cse5 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse23 (store .cse25 (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6) v_ArrVal_5403))) (let ((.cse24 (+ (select (select .cse23 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4) 12))) (< (select (select (store .cse23 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse23 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) v_arrayElimCell_36) .cse24) .cse24)))) (= (select (select .cse25 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))))) (.cse15 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse13 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|))) (and (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store .cse8 .cse5 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse3 (store .cse7 (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6) v_ArrVal_5403))) (let ((.cse1 (store .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))) (or (let ((.cse2 (+ (select (select .cse3 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4) 12))) (< (select (select .cse1 v_arrayElimCell_36) .cse2) .cse2)) (< (select (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse5) .cse5))))) (= (select (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (or (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse9 (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6))) (let ((.cse12 (store (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store .cse8 .cse5 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse9 v_ArrVal_5403))) (let ((.cse10 (store .cse12 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse12 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse9) (let ((.cse11 (+ (select (select .cse12 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4) 12))) (< (select (select .cse10 v_arrayElimCell_36) .cse11) .cse11)) (< (select (select .cse10 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse5) .cse5)))))))) (or .cse13 .cse14) (or .cse15 .cse14) (or (and (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (or (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (forall ((v_ArrVal_5401 (Array Int Int)) (v_ArrVal_5403 (Array Int Int))) (let ((.cse16 (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse16) (< (select (select (let ((.cse17 (store (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store .cse8 .cse5 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse16 v_ArrVal_5403))) (store .cse17 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse17 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse5) .cse5)))))) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse18 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store .cse8 .cse5 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (= (select (select .cse18 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|) (forall ((v_ArrVal_5401 (Array Int Int)) (v_ArrVal_5403 (Array Int Int))) (< (select (select (let ((.cse19 (store .cse18 (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6) v_ArrVal_5403))) (store .cse19 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse19 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse5) .cse5)))))) (not .cse15) (not .cse13)))))) is different from false [2024-11-08 12:03:45,563 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse18 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse5 (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.base|))) (let ((.cse12 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (.cse20 (and (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse30 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.base| (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset| v_ArrVal_5399)))) (let ((.cse31 (select .cse30 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) (or (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.base| v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse27) (let ((.cse28 (store (store .cse30 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store .cse31 .cse5 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse27 v_ArrVal_5403))) (let ((.cse29 (+ (select (select .cse28 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse18) 12))) (< (select (select (store .cse28 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse28 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) v_arrayElimCell_36) .cse29) .cse29)))))) (< (select .cse31 .cse5) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|))))) (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse36 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.base| (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset| v_ArrVal_5399)))) (let ((.cse32 (select .cse36 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) (let ((.cse35 (store .cse36 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store .cse32 .cse5 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (< (select .cse32 .cse5) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse33 (store .cse35 (select (select (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.base| v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) v_ArrVal_5403))) (let ((.cse34 (+ (select (select .cse33 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse18) 12))) (< (select (select (store .cse33 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse33 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) v_arrayElimCell_36) .cse34) .cse34)))) (= (select (select .cse35 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))))))) (.cse11 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (and (or (and (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.base| (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset| v_ArrVal_5399)))) (let ((.cse4 (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) (or (forall ((v_ArrVal_5401 (Array Int Int)) (v_ArrVal_5403 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.base| v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse0) (< (select (select (let ((.cse1 (store (store .cse3 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store .cse4 .cse5 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse0 v_ArrVal_5403))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse5) .cse5)))) (< (select .cse4 .cse5) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|))))) (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.base| (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset| v_ArrVal_5399)))) (let ((.cse9 (select .cse10 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) (let ((.cse8 (store .cse10 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store .cse9 .cse5 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (forall ((v_ArrVal_5401 (Array Int Int)) (v_ArrVal_5403 (Array Int Int))) (< (select (select (let ((.cse7 (store .cse8 (select (select (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.base| v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) v_ArrVal_5403))) (store .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse5) .cse5)) (< (select .cse9 .cse5) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (= (select (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))))) (not .cse11) (not .cse12)) (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.base| (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset| v_ArrVal_5399)))) (let ((.cse13 (select .cse19 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) (let ((.cse14 (store .cse19 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store .cse13 .cse5 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (< (select .cse13 .cse5) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (= (select (select .cse14 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|) (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse17 (store .cse14 (select (select (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.base| v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) v_ArrVal_5403))) (let ((.cse15 (store .cse17 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse17 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))) (or (let ((.cse16 (+ (select (select .cse17 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse18) 12))) (< (select (select .cse15 v_arrayElimCell_36) .cse16) .cse16)) (< (select (select .cse15 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse5) .cse5)))))))))) (or .cse12 .cse20) (or .cse20 .cse11) (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse25 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.base| (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset| v_ArrVal_5399)))) (let ((.cse26 (select .cse25 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) (or (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.base| v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2))) (let ((.cse24 (store (store .cse25 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store .cse26 .cse5 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse21 v_ArrVal_5403))) (let ((.cse22 (store .cse24 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse24 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse21) (let ((.cse23 (+ (select (select .cse24 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse18) 12))) (< (select (select .cse22 v_arrayElimCell_36) .cse23) .cse23)) (< (select (select .cse22 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse5) .cse5)))))) (< (select .cse26 .cse5) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|)))))))) is different from false [2024-11-08 12:04:20,019 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 12 |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.offset|))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.base|) .cse4))) (let ((.cse14 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.base|) .cse4)) (.cse7 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse8 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse13 (select |c_#memory_$Pointer$.offset| .cse10))) (let ((.cse0 (and (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse14 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse33 (store |c_#memory_$Pointer$.offset| .cse10 (store .cse13 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399)))) (let ((.cse32 (select .cse33 |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.base|))) (let ((.cse31 (store .cse33 |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.base| (store .cse32 .cse4 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse29 (store .cse31 (select (select (store (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8) v_ArrVal_5403))) (let ((.cse30 (+ (select (select .cse29 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse7) 12))) (< (select (select (store .cse29 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse29 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.offset|)) v_arrayElimCell_36) .cse30) .cse30)))) (= (select (select .cse31 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8) |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.offset|) (< (select .cse32 .cse4) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|)))))))) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse14 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse37 (store |c_#memory_$Pointer$.offset| .cse10 (store .cse13 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399)))) (let ((.cse38 (select .cse37 |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.base|))) (or (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8))) (or (= |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.base| .cse34) (let ((.cse35 (store (store .cse37 |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.base| (store .cse38 .cse4 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse34 v_ArrVal_5403))) (let ((.cse36 (+ (select (select .cse35 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse7) 12))) (< (select (select (store .cse35 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse35 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.offset|)) v_arrayElimCell_36) .cse36) .cse36)))))) (< (select .cse38 .cse4) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|))))))))) (.cse1 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse2 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|))) (and (or .cse0 .cse1) (or .cse0 .cse2) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse12 (store |c_#memory_$Pointer$.offset| .cse10 (store .cse13 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399)))) (let ((.cse11 (select .cse12 |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.base|))) (let ((.cse9 (store .cse12 |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.base| (store .cse11 .cse4 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse6 (store .cse9 (select (select (store (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8) v_ArrVal_5403))) (let ((.cse3 (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.offset|)))) (or (< (select (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.base|) .cse4) .cse4) (let ((.cse5 (+ (select (select .cse6 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse7) 12))) (< (select (select .cse3 v_arrayElimCell_36) .cse5) .cse5)))))) (= (select (select .cse9 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8) |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.offset|) (< (select .cse11 .cse4) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|)))))) (< .cse14 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|))) (or (and (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse17 (store |c_#memory_$Pointer$.offset| .cse10 (store .cse13 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399)))) (let ((.cse18 (select .cse17 |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.base|))) (or (forall ((v_ArrVal_5401 (Array Int Int)) (v_ArrVal_5403 (Array Int Int))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8))) (or (= |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.base| .cse15) (< (select (select (let ((.cse16 (store (store .cse17 |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.base| (store .cse18 .cse4 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse15 v_ArrVal_5403))) (store .cse16 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse16 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.offset|))) |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.base|) .cse4) .cse4)))) (< (select .cse18 .cse4) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|))))) (< .cse14 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|))) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse22 (store |c_#memory_$Pointer$.offset| .cse10 (store .cse13 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399)))) (let ((.cse21 (select .cse22 |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.base|))) (let ((.cse19 (store .cse22 |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.base| (store .cse21 .cse4 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (= (select (select .cse19 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8) |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.offset|) (forall ((v_ArrVal_5401 (Array Int Int)) (v_ArrVal_5403 (Array Int Int))) (< (select (select (let ((.cse20 (store .cse19 (select (select (store (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8) v_ArrVal_5403))) (store .cse20 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse20 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.offset|))) |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.base|) .cse4) .cse4)) (< (select .cse21 .cse4) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|)))))) (< .cse14 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|)))) (not .cse1) (not .cse2)) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse14 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse27 (store |c_#memory_$Pointer$.offset| .cse10 (store .cse13 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399)))) (let ((.cse28 (select .cse27 |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.base|))) (or (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8))) (let ((.cse26 (store (store .cse27 |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.base| (store .cse28 .cse4 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse23 v_ArrVal_5403))) (let ((.cse24 (store .cse26 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse26 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.offset|)))) (or (= |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.base| .cse23) (< (select (select .cse24 |c_pusherThread1of1ForFork0_fifo_push_#t~ret30#1.base|) .cse4) .cse4) (let ((.cse25 (+ (select (select .cse26 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse7) 12))) (< (select (select .cse24 v_arrayElimCell_36) .cse25) .cse25))))))) (< (select .cse28 .cse4) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|)))))))))))) is different from false [2024-11-08 12:04:21,642 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.offset| 12))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|) .cse5))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|) .cse5)) (.cse19 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse8 (select |c_#memory_$Pointer$.offset| .cse4))) (let ((.cse13 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse14 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (.cse15 (and (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse33 (store |c_#memory_$Pointer$.offset| .cse4 (store .cse8 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399)))) (let ((.cse32 (select .cse33 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|))) (let ((.cse31 (store .cse33 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| (store .cse32 .cse5 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse29 (store .cse31 (select (select (store (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) v_ArrVal_5403))) (let ((.cse30 (+ 12 (select (select .cse29 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse19)))) (< (select (select (store .cse29 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse29 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.offset|)) v_arrayElimCell_36) .cse30) .cse30)))) (= (select (select .cse31 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.offset|) (< (select .cse32 .cse5) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|)))))))) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse36 (store |c_#memory_$Pointer$.offset| .cse4 (store .cse8 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399)))) (let ((.cse37 (select .cse36 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|))) (or (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse38 (select (select (store (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2))) (or (let ((.cse34 (store (store .cse36 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| (store .cse37 .cse5 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse38 v_ArrVal_5403))) (let ((.cse35 (+ 12 (select (select .cse34 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse19)))) (< (select (select (store .cse34 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse34 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.offset|)) v_arrayElimCell_36) .cse35) .cse35))) (= .cse38 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|)))) (< (select .cse37 .cse5) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|)))))))))) (and (or (and (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse7 (store |c_#memory_$Pointer$.offset| .cse4 (store .cse8 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399)))) (let ((.cse6 (select .cse7 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|))) (let ((.cse3 (store .cse7 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| (store .cse6 .cse5 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (forall ((v_ArrVal_5401 (Array Int Int)) (v_ArrVal_5403 (Array Int Int))) (< (select (select (let ((.cse1 (store .cse3 (select (select (store (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) v_ArrVal_5403))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.offset|))) |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|) .cse5) .cse5)) (= (select (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.offset|) (< (select .cse6 .cse5) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|)))))))) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse11 (store |c_#memory_$Pointer$.offset| .cse4 (store .cse8 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399)))) (let ((.cse9 (select .cse11 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|))) (or (< (select .cse9 .cse5) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (forall ((v_ArrVal_5401 (Array Int Int)) (v_ArrVal_5403 (Array Int Int))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2))) (or (< (select (select (let ((.cse10 (store (store .cse11 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| (store .cse9 .cse5 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse12 v_ArrVal_5403))) (store .cse10 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse10 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.offset|))) |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|) .cse5) .cse5) (= .cse12 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|))))))))))) (not .cse13) (not .cse14)) (or .cse15 .cse13) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse21 (store |c_#memory_$Pointer$.offset| .cse4 (store .cse8 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399)))) (let ((.cse22 (select .cse21 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|))) (or (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2))) (let ((.cse18 (store (store .cse21 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| (store .cse22 .cse5 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse20 v_ArrVal_5403))) (let ((.cse16 (store .cse18 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse18 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.offset|)))) (or (let ((.cse17 (+ 12 (select (select .cse18 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse19)))) (< (select (select .cse16 v_arrayElimCell_36) .cse17) .cse17)) (< (select (select .cse16 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|) .cse5) .cse5) (= .cse20 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|)))))) (< (select .cse22 .cse5) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|))))))) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse28 (store |c_#memory_$Pointer$.offset| .cse4 (store .cse8 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399)))) (let ((.cse27 (select .cse28 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|))) (let ((.cse26 (store .cse28 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| (store .cse27 .cse5 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse25 (store .cse26 (select (select (store (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) v_ArrVal_5403))) (let ((.cse23 (store .cse25 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse25 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.offset|)))) (or (let ((.cse24 (+ 12 (select (select .cse25 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse19)))) (< (select (select .cse23 v_arrayElimCell_36) .cse24) .cse24)) (< (select (select .cse23 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|) .cse5) .cse5))))) (= (select (select .cse26 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.offset|) (< (select .cse27 .cse5) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|)))))))) (or .cse14 .cse15)))))) is different from false [2024-11-08 12:04:22,149 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse6))) (let ((.cse5 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse7 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse11 (select |c_#memory_$Pointer$.offset| .cse10)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse6))) (let ((.cse18 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse28 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (.cse19 (and (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse32 (store |c_#memory_$Pointer$.offset| .cse10 (store .cse11 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399)))) (let ((.cse33 (select .cse32 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (or (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7))) (or (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse29) (let ((.cse30 (store (store .cse32 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse33 .cse6 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse29 v_ArrVal_5403))) (let ((.cse31 (+ (select (select .cse30 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse5) 12))) (< (select (select (store .cse30 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse30 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_arrayElimCell_36) .cse31) .cse31)))))) (< (select .cse33 .cse6) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|))))) (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|))) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse38 (store |c_#memory_$Pointer$.offset| .cse10 (store .cse11 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399)))) (let ((.cse34 (select .cse38 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (let ((.cse37 (store .cse38 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse34 .cse6 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (< (select .cse34 .cse6) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse35 (store .cse37 (select (select (store (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7) v_ArrVal_5403))) (let ((.cse36 (+ (select (select .cse35 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse5) 12))) (< (select (select (store .cse35 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse35 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_arrayElimCell_36) .cse36) .cse36)))) (= (select (select .cse37 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)))))) (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|)))))) (and (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse10 (store .cse11 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399)))) (let ((.cse9 (select .cse8 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (or (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7))) (let ((.cse4 (store (store .cse8 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse9 .cse6 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse1 v_ArrVal_5403))) (let ((.cse2 (store .cse4 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse4 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)))) (or (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse1) (let ((.cse3 (+ (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse5) 12))) (< (select (select .cse2 v_arrayElimCell_36) .cse3) .cse3)) (< (select (select .cse2 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse6) .cse6)))))) (< (select .cse9 .cse6) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|))))))) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse17 (store |c_#memory_$Pointer$.offset| .cse10 (store .cse11 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399)))) (let ((.cse12 (select .cse17 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (let ((.cse16 (store .cse17 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse12 .cse6 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (< (select .cse12 .cse6) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse15 (store .cse16 (select (select (store (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7) v_ArrVal_5403))) (let ((.cse13 (store .cse15 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse15 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)))) (or (let ((.cse14 (+ (select (select .cse15 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse5) 12))) (< (select (select .cse13 v_arrayElimCell_36) .cse14) .cse14)) (< (select (select .cse13 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse6) .cse6))))) (= (select (select .cse16 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)))))) (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|))) (or .cse18 .cse19) (or (and (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse23 (store |c_#memory_$Pointer$.offset| .cse10 (store .cse11 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399)))) (let ((.cse22 (select .cse23 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (let ((.cse21 (store .cse23 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse22 .cse6 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (forall ((v_ArrVal_5401 (Array Int Int)) (v_ArrVal_5403 (Array Int Int))) (< (select (select (let ((.cse20 (store .cse21 (select (select (store (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7) v_ArrVal_5403))) (store .cse20 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse20 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse6) .cse6)) (< (select .cse22 .cse6) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (= (select (select .cse21 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)))))))) (forall ((|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse0 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse27 (store |c_#memory_$Pointer$.offset| .cse10 (store .cse11 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399)))) (let ((.cse24 (select .cse27 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (or (< (select .cse24 .cse6) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (forall ((v_ArrVal_5401 (Array Int Int)) (v_ArrVal_5403 (Array Int Int))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7))) (or (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse25) (< (select (select (let ((.cse26 (store (store .cse27 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse24 .cse6 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse25 v_ArrVal_5403))) (store .cse26 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse26 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse6) .cse6))))))))))) (not .cse18) (not .cse28)) (or .cse28 .cse19)))))) is different from false [2024-11-08 12:04:25,680 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (.cse4 (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse13 (select .cse11 .cse4)) (.cse24 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse6 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse4)) (.cse12 (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse1 (and (forall ((v_ArrVal_5396 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse39 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse11 .cse12 v_ArrVal_5396)))) (let ((.cse38 (store (select .cse39 .cse8) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399))) (let ((.cse34 (select (store .cse39 .cse8 .cse38) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (or (< (select .cse34 .cse4) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6))) (or (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse35) (let ((.cse36 (store (store (store |c_#memory_$Pointer$.offset| .cse8 .cse38) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse34 .cse4 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse35 v_ArrVal_5403))) (let ((.cse37 (+ (select (select .cse36 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse24) 12))) (< (select (select (store .cse36 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse36 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_arrayElimCell_36) .cse37) .cse37))))))))))) (< .cse13 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|))) (forall ((v_ArrVal_5396 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse13 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse45 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse11 .cse12 v_ArrVal_5396)))) (let ((.cse44 (store (select .cse45 .cse8) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399))) (let ((.cse40 (select (store .cse45 .cse8 .cse44) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (let ((.cse43 (store (store |c_#memory_$Pointer$.offset| .cse8 .cse44) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse40 .cse4 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (< (select .cse40 .cse4) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse41 (store .cse43 (select (select (store (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6) v_ArrVal_5403))) (let ((.cse42 (+ (select (select .cse41 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse24) 12))) (< (select (select (store .cse41 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse41 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_arrayElimCell_36) .cse42) .cse42)))) (= (select (select .cse43 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))))))))))) (.cse0 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse2 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|))) (and (or .cse0 .cse1) (or .cse2 .cse1) (or (and (forall ((v_ArrVal_5396 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse11 .cse12 v_ArrVal_5396)))) (let ((.cse9 (store (select .cse10 .cse8) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399))) (let ((.cse3 (select (store .cse10 .cse8 .cse9) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| .cse8 .cse9) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse3 .cse4 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (< (select .cse3 .cse4) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (forall ((v_ArrVal_5401 (Array Int Int)) (v_ArrVal_5403 (Array Int Int))) (< (select (select (let ((.cse5 (store .cse7 (select (select (store (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6) v_ArrVal_5403))) (store .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse4) .cse4)) (= (select (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))))))) (< .cse13 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|))) (forall ((v_ArrVal_5396 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse13 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse18 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse11 .cse12 v_ArrVal_5396)))) (let ((.cse16 (store (select .cse18 .cse8) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399))) (let ((.cse17 (select (store .cse18 .cse8 .cse16) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (or (forall ((v_ArrVal_5401 (Array Int Int)) (v_ArrVal_5403 (Array Int Int))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6))) (or (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse14) (< (select (select (let ((.cse15 (store (store (store |c_#memory_$Pointer$.offset| .cse8 .cse16) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse17 .cse4 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse14 v_ArrVal_5403))) (store .cse15 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse15 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse4) .cse4)))) (< (select .cse17 .cse4) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|))))))))) (not .cse0) (not .cse2)) (forall ((v_ArrVal_5396 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse26 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse11 .cse12 v_ArrVal_5396)))) (let ((.cse25 (store (select .cse26 .cse8) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399))) (let ((.cse19 (select (store .cse26 .cse8 .cse25) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (or (< (select .cse19 .cse4) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6))) (let ((.cse23 (store (store (store |c_#memory_$Pointer$.offset| .cse8 .cse25) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse19 .cse4 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse20 v_ArrVal_5403))) (let ((.cse21 (store .cse23 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse23 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)))) (or (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse20) (let ((.cse22 (+ (select (select .cse23 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse24) 12))) (< (select (select .cse21 v_arrayElimCell_36) .cse22) .cse22)) (< (select (select .cse21 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse4) .cse4))))))))))) (< .cse13 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|))) (forall ((v_ArrVal_5396 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse13 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse33 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse11 .cse12 v_ArrVal_5396)))) (let ((.cse32 (store (select .cse33 .cse8) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399))) (let ((.cse27 (select (store .cse33 .cse8 .cse32) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (let ((.cse31 (store (store |c_#memory_$Pointer$.offset| .cse8 .cse32) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse27 .cse4 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (< (select .cse27 .cse4) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse30 (store .cse31 (select (select (store (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6) v_ArrVal_5403))) (let ((.cse28 (store .cse30 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse30 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)))) (or (let ((.cse29 (+ (select (select .cse30 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse24) 12))) (< (select (select .cse28 v_arrayElimCell_36) .cse29) .cse29)) (< (select (select .cse28 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse4) .cse4))))) (= (select (select .cse31 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))))))))))))) is different from false [2024-11-08 12:04:27,690 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (.cse4 (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse13 (select .cse11 .cse4)) (.cse24 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse6 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse4)) (.cse12 (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse1 (and (forall ((v_ArrVal_5396 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse39 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse11 .cse12 v_ArrVal_5396)))) (let ((.cse38 (store (select .cse39 .cse8) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399))) (let ((.cse34 (select (store .cse39 .cse8 .cse38) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (or (< (select .cse34 .cse4) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6))) (or (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse35) (let ((.cse36 (store (store (store |c_#memory_$Pointer$.offset| .cse8 .cse38) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse34 .cse4 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse35 v_ArrVal_5403))) (let ((.cse37 (+ (select (select .cse36 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse24) 12))) (< (select (select (store .cse36 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse36 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_arrayElimCell_36) .cse37) .cse37))))))))))) (< .cse13 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|))) (forall ((v_ArrVal_5396 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse13 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse45 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse11 .cse12 v_ArrVal_5396)))) (let ((.cse44 (store (select .cse45 .cse8) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399))) (let ((.cse40 (select (store .cse45 .cse8 .cse44) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (let ((.cse43 (store (store |c_#memory_$Pointer$.offset| .cse8 .cse44) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse40 .cse4 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (< (select .cse40 .cse4) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse41 (store .cse43 (select (select (store (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6) v_ArrVal_5403))) (let ((.cse42 (+ (select (select .cse41 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse24) 12))) (< (select (select (store .cse41 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse41 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_arrayElimCell_36) .cse42) .cse42)))) (= (select (select .cse43 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))))))))))) (.cse0 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse2 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|))) (and (or .cse0 .cse1) (or .cse2 .cse1) (or (and (forall ((v_ArrVal_5396 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse11 .cse12 v_ArrVal_5396)))) (let ((.cse9 (store (select .cse10 .cse8) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399))) (let ((.cse3 (select (store .cse10 .cse8 .cse9) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| .cse8 .cse9) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse3 .cse4 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (< (select .cse3 .cse4) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (forall ((v_ArrVal_5401 (Array Int Int)) (v_ArrVal_5403 (Array Int Int))) (< (select (select (let ((.cse5 (store .cse7 (select (select (store (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6) v_ArrVal_5403))) (store .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse4) .cse4)) (= (select (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))))))) (< .cse13 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|))) (forall ((v_ArrVal_5396 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse13 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse18 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse11 .cse12 v_ArrVal_5396)))) (let ((.cse16 (store (select .cse18 .cse8) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399))) (let ((.cse17 (select (store .cse18 .cse8 .cse16) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (or (forall ((v_ArrVal_5401 (Array Int Int)) (v_ArrVal_5403 (Array Int Int))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6))) (or (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse14) (< (select (select (let ((.cse15 (store (store (store |c_#memory_$Pointer$.offset| .cse8 .cse16) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse17 .cse4 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse14 v_ArrVal_5403))) (store .cse15 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse15 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse4) .cse4)))) (< (select .cse17 .cse4) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|))))))))) (not .cse0) (not .cse2)) (forall ((v_ArrVal_5396 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse26 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse11 .cse12 v_ArrVal_5396)))) (let ((.cse25 (store (select .cse26 .cse8) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399))) (let ((.cse19 (select (store .cse26 .cse8 .cse25) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (or (< (select .cse19 .cse4) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6))) (let ((.cse23 (store (store (store |c_#memory_$Pointer$.offset| .cse8 .cse25) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse19 .cse4 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse20 v_ArrVal_5403))) (let ((.cse21 (store .cse23 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse23 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)))) (or (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse20) (let ((.cse22 (+ (select (select .cse23 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse24) 12))) (< (select (select .cse21 v_arrayElimCell_36) .cse22) .cse22)) (< (select (select .cse21 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse4) .cse4))))))))))) (< .cse13 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|))) (forall ((v_ArrVal_5396 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (< .cse13 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|) (forall ((v_ArrVal_5398 (Array Int Int)) (v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse33 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse11 .cse12 v_ArrVal_5396)))) (let ((.cse32 (store (select .cse33 .cse8) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399))) (let ((.cse27 (select (store .cse33 .cse8 .cse32) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (let ((.cse31 (store (store |c_#memory_$Pointer$.offset| .cse8 .cse32) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse27 .cse4 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (< (select .cse27 .cse4) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse30 (store .cse31 (select (select (store (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_5398) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6) v_ArrVal_5403))) (let ((.cse28 (store .cse30 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse30 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)))) (or (let ((.cse29 (+ (select (select .cse30 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse24) 12))) (< (select (select .cse28 v_arrayElimCell_36) .cse29) .cse29)) (< (select (select .cse28 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse4) .cse4))))) (= (select (select .cse31 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))))))))))))) is different from true [2024-11-08 12:06:34,283 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse6 (+ |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.offset| 16)) (.cse5 (+ |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.offset| 12)) (.cse11 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse3 (+ |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.offset| 4))) (let ((.cse1 (and (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| Int)) (or (forall ((v_ArrVal_5387 Int)) (or (forall ((v_ArrVal_5391 Int) (v_ArrVal_5396 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (forall ((v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse16 (select |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17|))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| (store (store (store (store .cse16 |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.offset| v_ArrVal_5391) .cse6 v_ArrVal_5396) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399) .cse5 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (< (select (store (store (store (store .cse16 .cse5 v_ArrVal_5387) |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.offset| v_ArrVal_5391) .cse6 v_ArrVal_5396) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399) .cse5) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (= (select (select .cse17 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11) |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.offset|) (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse18 (store .cse17 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11) v_ArrVal_5403))) (let ((.cse19 (+ 12 (select (select .cse18 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse10)))) (< (select (select (store .cse18 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse18 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11 |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.offset|)) v_arrayElimCell_36) .cse19) .cse19)))))))) (< v_ArrVal_5387 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|))) (< .cse3 v_ArrVal_5387))) (< |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17|))) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| Int)) (or (forall ((v_ArrVal_5387 Int)) (or (forall ((v_ArrVal_5391 Int) (v_ArrVal_5396 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (forall ((v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse20 (select |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17|))) (or (< (select (store (store (store (store .cse20 .cse5 v_ArrVal_5387) |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.offset| v_ArrVal_5391) .cse6 v_ArrVal_5396) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399) .cse5) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse23 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11))) (or (let ((.cse21 (store (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| (store (store (store (store .cse20 |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.offset| v_ArrVal_5391) .cse6 v_ArrVal_5396) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399) .cse5 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse23 v_ArrVal_5403))) (let ((.cse22 (+ 12 (select (select .cse21 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse10)))) (< (select (select (store .cse21 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse21 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11 |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.offset|)) v_arrayElimCell_36) .cse22) .cse22))) (= .cse23 |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17|))))))) (< v_ArrVal_5387 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|))) (< .cse3 v_ArrVal_5387))) (< |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17|))))) (.cse0 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse2 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|))) (and (or .cse0 .cse1) (or .cse2 .cse1) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| Int)) (or (forall ((v_ArrVal_5387 Int)) (or (< .cse3 v_ArrVal_5387) (forall ((v_ArrVal_5391 Int) (v_ArrVal_5396 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (or (forall ((v_ArrVal_5399 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int)) (let ((.cse4 (select |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17|))) (let ((.cse12 (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| (store (store (store (store .cse4 |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.offset| v_ArrVal_5391) .cse6 v_ArrVal_5396) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399) .cse5 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (< (select (store (store (store (store .cse4 .cse5 v_ArrVal_5387) |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.offset| v_ArrVal_5391) .cse6 v_ArrVal_5396) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399) .cse5) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (forall ((v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int))) (let ((.cse9 (store .cse12 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11) v_ArrVal_5403))) (let ((.cse7 (store .cse9 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse9 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11 |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.offset|)))) (or (let ((.cse8 (+ 12 (select (select .cse9 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse10)))) (< (select (select .cse7 v_arrayElimCell_36) .cse8) .cse8)) (< (select (select .cse7 |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17|) .cse5) .cse5))))) (= (select (select .cse12 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11) |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.offset|))))) (< v_ArrVal_5387 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|))))) (< |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17|))) (or (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| Int) (v_ArrVal_5391 Int) (v_ArrVal_5401 (Array Int Int)) (v_ArrVal_5403 (Array Int Int)) (v_ArrVal_5399 Int) (v_ArrVal_5387 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5396 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (let ((.cse13 (select |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17|))) (let ((.cse15 (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| (store (store (store (store .cse13 |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.offset| v_ArrVal_5391) .cse6 v_ArrVal_5396) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399) .cse5 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (< (select (store (store (store (store .cse13 .cse5 v_ArrVal_5387) |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.offset| v_ArrVal_5391) .cse6 v_ArrVal_5396) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399) .cse5) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (< .cse3 v_ArrVal_5387) (< (select (select (let ((.cse14 (store .cse15 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11) v_ArrVal_5403))) (store .cse14 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse14 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11 |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.offset|))) |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17|) .cse5) .cse5) (= (select (select .cse15 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11) |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.offset|) (< |c_pusherThread1of1ForFork0_fifo_push_#t~malloc29#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17|) (< v_ArrVal_5387 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|))))) (not .cse0) (not .cse2))))) is different from false [2024-11-08 12:06:34,948 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse3 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse1 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse6 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (.cse0 (and (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| Int) (v_ArrVal_5391 Int) (v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int)) (v_ArrVal_5399 Int) (v_ArrVal_5387 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5396 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (let ((.cse13 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3)) (.cse16 (select |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17|))) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| 1)) (= .cse13 |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17|) (let ((.cse14 (store (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| (store (store (store (store .cse16 0 v_ArrVal_5391) 16 v_ArrVal_5396) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399) 12 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse13 v_ArrVal_5403))) (let ((.cse15 (+ 12 (select (select .cse14 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse11)))) (< (select (select (store .cse14 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse14 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3 0)) v_arrayElimCell_36) .cse15) .cse15))) (< 4 v_ArrVal_5387) (< (select (store (store (store (store .cse16 12 v_ArrVal_5387) 0 v_ArrVal_5391) 16 v_ArrVal_5396) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399) 12) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (< v_ArrVal_5387 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|)))) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| Int) (v_ArrVal_5391 Int) (v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int)) (v_ArrVal_5399 Int) (v_ArrVal_5387 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5396 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (let ((.cse20 (select |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17|))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| (store (store (store (store .cse20 0 v_ArrVal_5391) 16 v_ArrVal_5396) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399) 12 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (= (select (select .cse17 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3) 0) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| 1)) (let ((.cse18 (store .cse17 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3) v_ArrVal_5403))) (let ((.cse19 (+ 12 (select (select .cse18 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse11)))) (< (select (select (store .cse18 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse18 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3 0)) v_arrayElimCell_36) .cse19) .cse19))) (< 4 v_ArrVal_5387) (< (select (store (store (store (store .cse20 12 v_ArrVal_5387) 0 v_ArrVal_5391) 16 v_ArrVal_5396) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399) 12) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (< v_ArrVal_5387 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|)))))))) (and (or .cse0 .cse1) (or (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| Int) (v_ArrVal_5391 Int) (v_ArrVal_5401 (Array Int Int)) (v_ArrVal_5403 (Array Int Int)) (v_ArrVal_5399 Int) (v_ArrVal_5387 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5396 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (let ((.cse5 (select |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17|))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| (store (store (store (store .cse5 0 v_ArrVal_5391) 16 v_ArrVal_5396) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399) 12 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (< (select (select (let ((.cse2 (store .cse4 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3) v_ArrVal_5403))) (store .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3 0))) |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17|) 12) 12) (= (select (select .cse4 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3) 0) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| 1)) (< 4 v_ArrVal_5387) (< (select (store (store (store (store .cse5 12 v_ArrVal_5387) 0 v_ArrVal_5391) 16 v_ArrVal_5396) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399) 12) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (< v_ArrVal_5387 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|))))) (not .cse1) (not .cse6)) (or .cse6 .cse0) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| Int) (v_ArrVal_5391 Int) (v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int)) (v_ArrVal_5399 Int) (v_ArrVal_5387 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5396 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (let ((.cse12 (select |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17|))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| (store (store (store (store .cse12 0 v_ArrVal_5391) 16 v_ArrVal_5396) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399) 12 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (let ((.cse10 (store .cse8 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3) v_ArrVal_5403))) (let ((.cse7 (store .cse10 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse10 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3 0)))) (or (< (select (select .cse7 |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17|) 12) 12) (= (select (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3) 0) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| 1)) (let ((.cse9 (+ 12 (select (select .cse10 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse11)))) (< (select (select .cse7 v_arrayElimCell_36) .cse9) .cse9)) (< 4 v_ArrVal_5387) (< (select (store (store (store (store .cse12 12 v_ArrVal_5387) 0 v_ArrVal_5391) 16 v_ArrVal_5396) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399) 12) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (< v_ArrVal_5387 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|)))))))))) is different from false [2024-11-08 12:06:46,206 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.offset| 4))) (let ((.cse8 (= |c_pusherThread1of1ForFork0_~q~0#1.base| |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|)) (.cse7 (= |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse12 (and (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| Int) (v_ArrVal_5391 Int) (v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int)) (v_ArrVal_5399 Int) (v_ArrVal_5387 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5396 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (let ((.cse13 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) .cse1)) (.cse16 (select |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17|))) (or (= .cse13 |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17|) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| 1)) (let ((.cse14 (store (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| (store (store (store (store .cse16 0 v_ArrVal_5391) 16 v_ArrVal_5396) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399) 12 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))) .cse13 v_ArrVal_5403))) (let ((.cse15 (+ (select (select .cse14 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse5) 12))) (< (select (select (store .cse14 |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base| (store (select .cse14 |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) .cse1 0)) v_arrayElimCell_36) .cse15) .cse15))) (< 4 v_ArrVal_5387) (< (select (store (store (store (store .cse16 12 v_ArrVal_5387) 0 v_ArrVal_5391) 16 v_ArrVal_5396) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399) 12) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (< v_ArrVal_5387 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|)))) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| Int) (v_ArrVal_5391 Int) (v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int)) (v_ArrVal_5399 Int) (v_ArrVal_5387 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5396 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (let ((.cse20 (select |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17|))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| (store (store (store (store .cse20 0 v_ArrVal_5391) 16 v_ArrVal_5396) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399) 12 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (= (select (select .cse17 |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) .cse1) 0) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| 1)) (let ((.cse18 (store .cse17 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) .cse1) v_ArrVal_5403))) (let ((.cse19 (+ (select (select .cse18 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse5) 12))) (< (select (select (store .cse18 |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base| (store (select .cse18 |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) .cse1 0)) v_arrayElimCell_36) .cse19) .cse19))) (< 4 v_ArrVal_5387) (< (select (store (store (store (store .cse20 12 v_ArrVal_5387) 0 v_ArrVal_5391) 16 v_ArrVal_5396) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399) 12) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (< v_ArrVal_5387 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|)))))))) (and (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| Int) (v_ArrVal_5391 Int) (v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int)) (v_ArrVal_5399 Int) (v_ArrVal_5387 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5396 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (let ((.cse6 (select |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17|))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| (store (store (store (store .cse6 0 v_ArrVal_5391) 16 v_ArrVal_5396) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399) 12 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (let ((.cse4 (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) .cse1) v_ArrVal_5403))) (let ((.cse2 (store .cse4 |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base| (store (select .cse4 |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) .cse1 0)))) (or (= (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) .cse1) 0) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| 1)) (let ((.cse3 (+ (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse5) 12))) (< (select (select .cse2 v_arrayElimCell_36) .cse3) .cse3)) (< (select (select .cse2 |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17|) 12) 12) (< 4 v_ArrVal_5387) (< (select (store (store (store (store .cse6 12 v_ArrVal_5387) 0 v_ArrVal_5391) 16 v_ArrVal_5396) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399) 12) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (< v_ArrVal_5387 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|))))))) (or (not .cse7) (not .cse8) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| Int) (v_ArrVal_5391 Int) (v_ArrVal_5401 (Array Int Int)) (v_ArrVal_5403 (Array Int Int)) (v_ArrVal_5399 Int) (v_ArrVal_5387 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5396 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (let ((.cse11 (select |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17|))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| (store (store (store (store .cse11 0 v_ArrVal_5391) 16 v_ArrVal_5396) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399) 12 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (= (select (select .cse9 |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) .cse1) 0) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| 1)) (< (select (select (let ((.cse10 (store .cse9 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| v_ArrVal_5401) |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) .cse1) v_ArrVal_5403))) (store .cse10 |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base| (store (select .cse10 |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) .cse1 0))) |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17|) 12) 12) (< 4 v_ArrVal_5387) (< (select (store (store (store (store .cse11 12 v_ArrVal_5387) 0 v_ArrVal_5391) 16 v_ArrVal_5396) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399) 12) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (< v_ArrVal_5387 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|)))))) (or .cse12 .cse8) (or .cse7 .cse12)))) is different from false [2024-11-08 12:06:46,805 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))) (and (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| Int) (v_ArrVal_5391 Int) (v_ArrVal_5401 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_5403 (Array Int Int)) (v_ArrVal_5399 Int) (v_ArrVal_5387 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5396 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (let ((.cse5 (select |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17|))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| (store (store (store (store .cse5 0 v_ArrVal_5391) 16 v_ArrVal_5396) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399) 12 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (let ((.cse6 (store .cse4 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| v_ArrVal_5401) |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3) v_ArrVal_5403))) (let ((.cse2 (select .cse6 |c_pusherThread1of1ForFork0_~q~0#1.base|))) (let ((.cse0 (store .cse6 |c_pusherThread1of1ForFork0_~q~0#1.base| (store .cse2 .cse3 0)))) (or (let ((.cse1 (+ (select .cse2 .cse3) 12))) (< (select (select .cse0 v_arrayElimCell_36) .cse1) .cse1)) (= (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3) 0) (< (select (select .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17|) 12) 12) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| 1)) (< 4 v_ArrVal_5387) (< (select (store (store (store (store .cse5 12 v_ArrVal_5387) 0 v_ArrVal_5391) 16 v_ArrVal_5396) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399) 12) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (< v_ArrVal_5387 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|)))))))) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| Int) (v_ArrVal_5391 Int) (v_ArrVal_5401 (Array Int Int)) (v_ArrVal_5403 (Array Int Int)) (v_ArrVal_5399 Int) (v_ArrVal_5387 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| Int) (v_ArrVal_5396 Int) (|v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| Int)) (let ((.cse9 (select |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17|))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| (store (store (store (store .cse9 0 v_ArrVal_5391) 16 v_ArrVal_5396) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399) 12 (+ |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28| 4))))) (or (= (select (select .cse7 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3) 0) (< (select (select (let ((.cse8 (store .cse7 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| v_ArrVal_5401) |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3) v_ArrVal_5403))) (store .cse8 |c_pusherThread1of1ForFork0_~q~0#1.base| (store (select .cse8 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3 0))) |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17|) 12) 12) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base_17| 1)) (< 4 v_ArrVal_5387) (< (select (store (store (store (store .cse9 12 v_ArrVal_5387) 0 v_ArrVal_5391) 16 v_ArrVal_5396) |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38| v_ArrVal_5399) 12) |v_pusherThread1of1ForFork0_fifo_push_#t~mem34#1.offset_28|) (< v_ArrVal_5387 |v_pusherThread1of1ForFork0_fifo_push_#t~mem32#1.offset_38|))))))) is different from false [2024-11-08 12:06:48,891 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 12:06:48,893 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 12:06:49,741 INFO L349 Elim1Store]: treesize reduction 359, result has 32.4 percent of original size [2024-11-08 12:06:49,743 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 771862 treesize of output 765815 [2024-11-08 12:06:51,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:06:51,384 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 61 treesize of output 52 [2024-11-08 12:06:51,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:06:51,723 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 1258 treesize of output 1270 [2024-11-08 12:06:52,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:06:52,035 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 832 treesize of output 693 [2024-11-08 12:06:52,382 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 318 treesize of output 270 [2024-11-08 12:06:52,464 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 286 treesize of output 270 [2024-11-08 12:06:52,703 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 12:06:52,800 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 12:06:52,814 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 58 treesize of output 54 [2024-11-08 12:06:53,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:06:53,317 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 111 treesize of output 111 [2024-11-08 12:06:53,499 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 12:06:53,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:06:53,538 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 [2024-11-08 12:07:00,351 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 12:07:00,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:07:00,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2024-11-08 12:07:00,413 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 12:07:00,414 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 17 treesize of output 11 [2024-11-08 12:07:00,444 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 12:07:00,445 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 29 treesize of output 23 [2024-11-08 12:07:00,473 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 12:07:00,474 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 17 treesize of output 11 [2024-11-08 12:07:00,502 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 12:07:00,503 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 21 treesize of output 15 [2024-11-08 12:07:00,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:07:00,537 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 14 treesize of output 16 [2024-11-08 12:07:00,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:07:00,606 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 12:07:00,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 1 [2024-11-08 12:07:00,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:07:00,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:07:00,742 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 12:07:00,744 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 12:07:00,806 INFO L349 Elim1Store]: treesize reduction 244, result has 0.4 percent of original size [2024-11-08 12:07:00,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 3627 treesize of output 1 [2024-11-08 12:07:27,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1286 backedges. 396 proven. 436 refuted. 9 times theorem prover too weak. 137 trivial. 308 not checked. [2024-11-08 12:07:27,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484379630] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:07:27,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:07:27,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 49, 41] total 128 [2024-11-08 12:07:27,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920147177] [2024-11-08 12:07:27,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:07:27,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 128 states [2024-11-08 12:07:27,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:07:27,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2024-11-08 12:07:27,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=678, Invalid=12415, Unknown=69, NotChecked=3094, Total=16256 [2024-11-08 12:07:27,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:07:27,793 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:07:27,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 128 states, 128 states have (on average 14.28125) internal successors, (1828), 128 states have internal predecessors, (1828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:07:27,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:07:27,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:07:27,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:07:27,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:07:27,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:07:27,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:07:27,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:07:27,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:07:27,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:07:27,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:07:27,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:07:27,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:07:27,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-08 12:07:27,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:07:27,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:07:30,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:07:32,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:07:38,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:07:41,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:07:45,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:07:47,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:07:50,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:07:53,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:07:55,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:07:58,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:07:59,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:08:02,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:08:04,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:08:06,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:08:11,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:08:13,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:08:14,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:08:17,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:08:20,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:08:22,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:08:25,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:08:28,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:08:30,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:08:32,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:08:35,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:08:38,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:08:44,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:08:46,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:08:48,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:08:50,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:08:52,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:08:54,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:08:56,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:09:00,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:09:04,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:09:06,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:09:08,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:09:11,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:09:13,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:09:15,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:09:18,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:09:24,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:09:26,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:09:30,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:09:32,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:09:33,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:09:35,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:09:38,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:09:40,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:09:43,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:09:46,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:09:49,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:09:51,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:09:53,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:09:56,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:09:58,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:09:59,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:10:02,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:10:05,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:10:07,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:10:11,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:10:16,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:10:18,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:10:23,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:10:26,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:10:29,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:10:32,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:10:34,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:10:36,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:10:38,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:10:41,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:10:42,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:10:44,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:10:47,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:10:52,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:10:54,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:10:57,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:11:00,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:11:05,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:11:09,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:11:14,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:11:15,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:11:20,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:11:22,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:11:45,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:11:49,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:11:51,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:11:54,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:11:55,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:11:57,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:11:59,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:12:03,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:12:11,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:12:14,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:12:17,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:12:27,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:12:30,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:12:38,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:12:40,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:12:48,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:12:53,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:13:19,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:13:48,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:13:57,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:14:00,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:14:16,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:14:19,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:14:21,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:14:24,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:14:26,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:14:29,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:14:57,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:14:59,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:15:01,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:15:05,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:15:10,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:15:19,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:15:41,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]