./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/queue.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e523f48 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/config/GemCutterMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/queue.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-5e523f4 [2024-11-21 00:34:02,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 00:34:02,925 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Default.epf [2024-11-21 00:34:02,933 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 00:34:02,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 00:34:02,977 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 00:34:02,979 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 00:34:02,980 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 00:34:02,980 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 00:34:02,981 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 00:34:02,982 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 00:34:02,983 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 00:34:02,983 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 00:34:02,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 00:34:02,983 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 00:34:02,984 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 00:34:02,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 00:34:02,985 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 00:34:02,985 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-21 00:34:02,985 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-21 00:34:02,985 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-21 00:34:02,985 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 00:34:02,985 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-21 00:34:02,985 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-21 00:34:02,986 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 00:34:02,986 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-21 00:34:02,986 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 00:34:02,986 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 00:34:02,986 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 00:34:02,986 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 00:34:02,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 00:34:02,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-21 00:34:02,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 00:34:02,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 00:34:02,987 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 00:34:02,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 00:34:02,987 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 00:34:02,987 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-11-21 00:34:02,987 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-21 00:34:02,987 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-21 00:34:02,987 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-21 00:34:02,988 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 [2024-11-21 00:34:03,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 00:34:03,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 00:34:03,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 00:34:03,417 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 00:34:03,417 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 00:34:03,418 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/../../sv-benchmarks/c/pthread/queue.i [2024-11-21 00:34:06,784 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/data/bc140af43/2bf15ed83fce4dcea08c41949915b618/FLAG1062cfd7e [2024-11-21 00:34:07,140 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 00:34:07,141 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/sv-benchmarks/c/pthread/queue.i [2024-11-21 00:34:07,160 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/data/bc140af43/2bf15ed83fce4dcea08c41949915b618/FLAG1062cfd7e [2024-11-21 00:34:07,176 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/data/bc140af43/2bf15ed83fce4dcea08c41949915b618 [2024-11-21 00:34:07,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 00:34:07,181 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 00:34:07,182 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 00:34:07,182 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 00:34:07,188 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 00:34:07,189 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:34:07" (1/1) ... [2024-11-21 00:34:07,190 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15fdd8a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:34:07, skipping insertion in model container [2024-11-21 00:34:07,190 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:34:07" (1/1) ... [2024-11-21 00:34:07,235 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 00:34:07,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 00:34:08,025 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 00:34:08,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 00:34:08,214 INFO L204 MainTranslator]: Completed translation [2024-11-21 00:34:08,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:34:08 WrapperNode [2024-11-21 00:34:08,215 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 00:34:08,217 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 00:34:08,217 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 00:34:08,217 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 00:34:08,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:34:08" (1/1) ... [2024-11-21 00:34:08,244 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:34:08" (1/1) ... [2024-11-21 00:34:08,303 INFO L138 Inliner]: procedures = 274, calls = 107, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 293 [2024-11-21 00:34:08,303 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 00:34:08,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 00:34:08,304 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 00:34:08,304 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 00:34:08,313 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:34:08" (1/1) ... [2024-11-21 00:34:08,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:34:08" (1/1) ... [2024-11-21 00:34:08,320 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:34:08" (1/1) ... [2024-11-21 00:34:08,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:34:08" (1/1) ... [2024-11-21 00:34:08,345 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:34:08" (1/1) ... [2024-11-21 00:34:08,347 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:34:08" (1/1) ... [2024-11-21 00:34:08,351 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:34:08" (1/1) ... [2024-11-21 00:34:08,354 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:34:08" (1/1) ... [2024-11-21 00:34:08,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:34:08" (1/1) ... [2024-11-21 00:34:08,359 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 00:34:08,360 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 00:34:08,360 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 00:34:08,360 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 00:34:08,361 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:34:08" (1/1) ... [2024-11-21 00:34:08,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-21 00:34:08,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:34:08,396 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-21 00:34:08,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-21 00:34:08,421 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-21 00:34:08,421 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-21 00:34:08,421 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-21 00:34:08,421 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-21 00:34:08,421 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-21 00:34:08,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-21 00:34:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-21 00:34:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-21 00:34:08,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 00:34:08,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-21 00:34:08,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 00:34:08,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 00:34:08,424 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-21 00:34:08,600 INFO L234 CfgBuilder]: Building ICFG [2024-11-21 00:34:08,602 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 00:34:09,521 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-21 00:34:09,522 INFO L283 CfgBuilder]: Performing block encoding [2024-11-21 00:34:10,164 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 00:34:10,166 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-21 00:34:10,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:34:10 BoogieIcfgContainer [2024-11-21 00:34:10,167 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 00:34:10,169 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 00:34:10,170 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 00:34:10,175 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 00:34:10,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:34:07" (1/3) ... [2024-11-21 00:34:10,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ee5256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:34:10, skipping insertion in model container [2024-11-21 00:34:10,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:34:08" (2/3) ... [2024-11-21 00:34:10,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ee5256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:34:10, skipping insertion in model container [2024-11-21 00:34:10,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:34:10" (3/3) ... [2024-11-21 00:34:10,180 INFO L128 eAbstractionObserver]: Analyzing ICFG queue.i [2024-11-21 00:34:10,199 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 00:34:10,201 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue.i that has 3 procedures, 159 locations, 1 initial locations, 2 loop locations, and 72 error locations. [2024-11-21 00:34:10,201 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-21 00:34:10,381 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-21 00:34:10,450 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:34:10,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-21 00:34:10,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:34:10,454 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-21 00:34:10,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-21 00:34:10,596 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:34:10,612 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2024-11-21 00:34:10,626 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=None, 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;@622bdf99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:34:10,626 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2024-11-21 00:34:10,994 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-21 00:34:11,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:34:11,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1122739102, now seen corresponding path program 1 times [2024-11-21 00:34:11,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:34:11,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168320342] [2024-11-21 00:34:11,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:34:11,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:34:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:34:11,460 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-21 00:34:11,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:34:11,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168320342] [2024-11-21 00:34:11,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168320342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:34:11,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:34:11,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:34:11,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546092984] [2024-11-21 00:34:11,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:34:11,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:34:11,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:34:11,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:34:11,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:34:11,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:11,503 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:34:11,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-21 00:34:11,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:11,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:11,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 00:34:11,762 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-21 00:34:11,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:34:11,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1122739101, now seen corresponding path program 1 times [2024-11-21 00:34:11,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:34:11,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225712936] [2024-11-21 00:34:11,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:34:11,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:34:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:34:13,490 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-21 00:34:13,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:34:13,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225712936] [2024-11-21 00:34:13,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225712936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:34:13,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:34:13,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-21 00:34:13,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429395521] [2024-11-21 00:34:13,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:34:13,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-21 00:34:13,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:34:13,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-21 00:34:13,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-21 00:34:13,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:13,497 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:34:13,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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-21 00:34:13,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:13,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:14,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:14,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:14,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 00:34:14,419 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err40ASSERT_VIOLATIONMEMORY_LEAK === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-21 00:34:14,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:34:14,420 INFO L85 PathProgramCache]: Analyzing trace with hash 165533751, now seen corresponding path program 1 times [2024-11-21 00:34:14,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:34:14,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488873731] [2024-11-21 00:34:14,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:34:14,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:34:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:34:14,523 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-21 00:34:14,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:34:14,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488873731] [2024-11-21 00:34:14,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488873731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:34:14,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:34:14,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 00:34:14,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608224043] [2024-11-21 00:34:14,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:34:14,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:34:14,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:34:14,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:34:14,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:34:14,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:14,525 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:34:14,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-21 00:34:14,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:14,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:14,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:14,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:14,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:14,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:14,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 00:34:14,717 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-21 00:34:14,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:34:14,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1461278638, now seen corresponding path program 1 times [2024-11-21 00:34:14,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:34:14,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79288353] [2024-11-21 00:34:14,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:34:14,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:34:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:34:14,907 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-21 00:34:14,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:34:14,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79288353] [2024-11-21 00:34:14,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79288353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:34:14,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:34:14,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-21 00:34:14,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767455454] [2024-11-21 00:34:14,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:34:14,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:34:14,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:34:14,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:34:14,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:34:14,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:14,913 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:34:14,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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-21 00:34:14,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:14,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:14,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:14,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:15,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:15,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:15,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:15,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:15,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 00:34:15,147 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-21 00:34:15,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:34:15,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1461278637, now seen corresponding path program 1 times [2024-11-21 00:34:15,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:34:15,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890094565] [2024-11-21 00:34:15,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:34:15,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:34:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:34:15,407 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-21 00:34:15,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:34:15,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890094565] [2024-11-21 00:34:15,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890094565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:34:15,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:34:15,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-21 00:34:15,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227861329] [2024-11-21 00:34:15,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:34:15,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:34:15,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:34:15,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:34:15,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:34:15,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:15,412 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:34:15,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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-21 00:34:15,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:15,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:15,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:15,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:15,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:15,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:15,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:15,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:15,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:15,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:15,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 00:34:15,938 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-21 00:34:15,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:34:15,939 INFO L85 PathProgramCache]: Analyzing trace with hash 165566458, now seen corresponding path program 1 times [2024-11-21 00:34:15,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:34:15,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656488666] [2024-11-21 00:34:15,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:34:15,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:34:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:34:16,025 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-21 00:34:16,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:34:16,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656488666] [2024-11-21 00:34:16,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656488666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:34:16,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:34:16,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:34:16,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956791145] [2024-11-21 00:34:16,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:34:16,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:34:16,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:34:16,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:34:16,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:34:16,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:16,030 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:34:16,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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-21 00:34:16,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:16,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:16,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:16,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:16,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:16,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:16,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:16,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:16,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:16,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:16,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:16,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:16,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-21 00:34:16,461 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-21 00:34:16,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:34:16,462 INFO L85 PathProgramCache]: Analyzing trace with hash 165566459, now seen corresponding path program 1 times [2024-11-21 00:34:16,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:34:16,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866681267] [2024-11-21 00:34:16,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:34:16,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:34:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:34:16,935 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-21 00:34:16,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:34:16,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866681267] [2024-11-21 00:34:16,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866681267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:34:16,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:34:16,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 00:34:16,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802534968] [2024-11-21 00:34:16,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:34:16,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-21 00:34:16,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:34:16,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-21 00:34:16,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-21 00:34:16,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:16,938 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:34:16,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-21 00:34:16,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:16,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:16,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:16,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:16,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:16,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:16,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:17,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:17,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:17,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:17,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:17,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:17,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:17,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:17,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-21 00:34:17,583 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err40ASSERT_VIOLATIONMEMORY_LEAK === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-21 00:34:17,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:34:17,584 INFO L85 PathProgramCache]: Analyzing trace with hash -998985647, now seen corresponding path program 1 times [2024-11-21 00:34:17,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:34:17,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577098365] [2024-11-21 00:34:17,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:34:17,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:34:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:34:18,552 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-21 00:34:18,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:34:18,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577098365] [2024-11-21 00:34:18,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577098365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:34:18,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:34:18,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-21 00:34:18,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106155593] [2024-11-21 00:34:18,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:34:18,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-21 00:34:18,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:34:18,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-21 00:34:18,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-21 00:34:18,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:18,555 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:34:18,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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-21 00:34:18,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:18,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:18,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:18,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:18,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:18,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:18,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:18,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:19,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:19,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:19,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:19,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:19,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:19,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:19,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:19,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:34:19,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-21 00:34:19,199 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err40ASSERT_VIOLATIONMEMORY_LEAK === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-21 00:34:19,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:34:19,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1709015627, now seen corresponding path program 1 times [2024-11-21 00:34:19,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:34:19,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576497580] [2024-11-21 00:34:19,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:34:19,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:34:19,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:34:21,274 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-21 00:34:21,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:34:21,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576497580] [2024-11-21 00:34:21,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576497580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:34:21,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:34:21,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-21 00:34:21,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663109654] [2024-11-21 00:34:21,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:34:21,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-21 00:34:21,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:34:21,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-21 00:34:21,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-21 00:34:21,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:21,279 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:34:21,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 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-21 00:34:21,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:21,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:21,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:21,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:21,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:21,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:21,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:21,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:34:21,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:22,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:22,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:22,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:22,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:22,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:22,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:22,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:22,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:34:22,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:34:22,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-21 00:34:22,688 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-21 00:34:22,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:34:22,689 INFO L85 PathProgramCache]: Analyzing trace with hash 536602052, now seen corresponding path program 1 times [2024-11-21 00:34:22,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:34:22,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454746052] [2024-11-21 00:34:22,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:34:22,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:34:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:34:24,604 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-21 00:34:24,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:34:24,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454746052] [2024-11-21 00:34:24,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454746052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:34:24,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:34:24,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-21 00:34:24,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323412710] [2024-11-21 00:34:24,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:34:24,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-21 00:34:24,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:34:24,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-21 00:34:24,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-21 00:34:24,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:24,607 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:34:24,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 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-21 00:34:24,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:24,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:24,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:24,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:24,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:24,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:24,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:24,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:34:24,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:34:24,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:26,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:26,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:26,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:26,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:26,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:26,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:26,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:26,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:34:26,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:34:26,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-21 00:34:26,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-21 00:34:26,053 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-21 00:34:26,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:34:26,054 INFO L85 PathProgramCache]: Analyzing trace with hash 42779494, now seen corresponding path program 1 times [2024-11-21 00:34:26,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:34:26,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302798688] [2024-11-21 00:34:26,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:34:26,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:34:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:34:26,306 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-21 00:34:26,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:34:26,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302798688] [2024-11-21 00:34:26,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302798688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:34:26,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:34:26,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:34:26,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632703204] [2024-11-21 00:34:26,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:34:26,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 00:34:26,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:34:26,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 00:34:26,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 00:34:26,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:26,313 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:34:26,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-21 00:34:26,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:26,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:26,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:26,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:26,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:26,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:26,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:26,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:34:26,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:34:26,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-21 00:34:26,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:26,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:26,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:26,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:26,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:26,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:26,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:26,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:26,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:34:26,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:34:26,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-21 00:34:26,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:34:26,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-21 00:34:26,575 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-21 00:34:26,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:34:26,576 INFO L85 PathProgramCache]: Analyzing trace with hash -891844609, now seen corresponding path program 1 times [2024-11-21 00:34:26,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:34:26,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624213020] [2024-11-21 00:34:26,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:34:26,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:34:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:34:26,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:34:26,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:34:26,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624213020] [2024-11-21 00:34:26,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624213020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:34:26,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:34:26,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 00:34:26,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514221610] [2024-11-21 00:34:26,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:34:26,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:34:26,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:34:26,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:34:26,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:34:26,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:26,682 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:34:26,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-21 00:34:26,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:26,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:26,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:26,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:26,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:26,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:26,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:26,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:34:26,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:34:26,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-21 00:34:26,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:34:26,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:28,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:28,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:28,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:28,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:28,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:28,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:28,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:28,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:34:28,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:34:28,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-21 00:34:28,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:34:28,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:28,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-21 00:34:28,263 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-21 00:34:28,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:34:28,263 INFO L85 PathProgramCache]: Analyzing trace with hash 710796, now seen corresponding path program 1 times [2024-11-21 00:34:28,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:34:28,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063853885] [2024-11-21 00:34:28,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:34:28,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:34:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:34:28,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-21 00:34:28,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:34:28,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063853885] [2024-11-21 00:34:28,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063853885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:34:28,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:34:28,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 00:34:28,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191525059] [2024-11-21 00:34:28,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:34:28,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:34:28,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:34:28,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:34:28,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:34:28,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:28,471 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:34:28,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-21 00:34:28,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:28,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:28,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:28,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:28,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:28,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:28,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:28,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:34:28,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:34:28,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-21 00:34:28,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:34:28,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:28,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:28,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:28,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:28,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:28,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:28,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:28,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:28,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:28,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:34:28,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:34:28,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-21 00:34:28,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:34:28,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:28,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:28,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-21 00:34:28,795 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-21 00:34:28,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:34:28,795 INFO L85 PathProgramCache]: Analyzing trace with hash 697007150, now seen corresponding path program 1 times [2024-11-21 00:34:28,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:34:28,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085371723] [2024-11-21 00:34:28,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:34:28,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:34:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:34:28,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:34:28,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:34:28,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085371723] [2024-11-21 00:34:28,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085371723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:34:28,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:34:28,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:34:28,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476780543] [2024-11-21 00:34:28,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:34:28,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:34:28,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:34:28,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:34:28,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:34:28,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:28,931 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:34:28,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 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-21 00:34:28,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:28,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:28,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:28,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:28,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:28,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:28,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:28,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:34:28,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:34:28,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-21 00:34:28,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:34:28,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:28,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:28,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:29,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:29,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:29,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:29,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:29,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:29,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:29,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:29,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:34:29,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:34:29,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-21 00:34:29,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:34:29,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:29,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:29,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:29,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-21 00:34:29,191 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-21 00:34:29,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:34:29,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1258990121, now seen corresponding path program 1 times [2024-11-21 00:34:29,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:34:29,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056969178] [2024-11-21 00:34:29,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:34:29,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:34:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:34:30,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:34:30,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:34:30,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056969178] [2024-11-21 00:34:30,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056969178] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:34:30,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288874604] [2024-11-21 00:34:30,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:34:30,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:34:30,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:34:30,598 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:34:30,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-21 00:34:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:34:30,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-21 00:34:30,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:34:31,460 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-21 00:34:31,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:34:31,530 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 16 treesize of output 11 [2024-11-21 00:34:31,783 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-21 00:34:31,848 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-21 00:34:32,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:34:32,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 00:34:32,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:34:32,715 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 26 treesize of output 27 [2024-11-21 00:34:32,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:34:32,729 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 46 treesize of output 45 [2024-11-21 00:34:32,751 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 11 treesize of output 7 [2024-11-21 00:34:32,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:34:32,766 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 29 treesize of output 30 [2024-11-21 00:34:32,771 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:34:32,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:34:32,775 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-21 00:34:33,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:34:33,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288874604] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 00:34:33,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 00:34:33,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 23 [2024-11-21 00:34:33,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572769136] [2024-11-21 00:34:33,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 00:34:33,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-21 00:34:33,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:34:33,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-21 00:34:33,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=496, Unknown=12, NotChecked=0, Total=600 [2024-11-21 00:34:33,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:33,227 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:34:33,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 8.5) internal successors, (204), 24 states have internal predecessors, (204), 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-21 00:34:33,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:33,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:33,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:33,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:33,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:33,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:33,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:33,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:34:33,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:34:33,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-21 00:34:33,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:34:33,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:33,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:33,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:33,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:36,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:36,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:36,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:36,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:36,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:36,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:36,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:36,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:34:36,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:34:36,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-21 00:34:36,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:34:36,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:36,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:36,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:36,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-21 00:34:36,335 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-21 00:34:36,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-21 00:34:36,510 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-21 00:34:36,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:34:36,511 INFO L85 PathProgramCache]: Analyzing trace with hash -859068429, now seen corresponding path program 1 times [2024-11-21 00:34:36,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:34:36,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154571732] [2024-11-21 00:34:36,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:34:36,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:34:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:34:36,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:34:36,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:34:36,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154571732] [2024-11-21 00:34:36,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154571732] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:34:36,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993534176] [2024-11-21 00:34:36,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:34:36,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:34:36,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:34:36,935 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:34:36,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-21 00:34:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:34:37,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-21 00:34:37,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:34:37,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:34:37,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 00:34:38,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:34:38,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993534176] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 00:34:38,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 00:34:38,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2024-11-21 00:34:38,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157982926] [2024-11-21 00:34:38,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 00:34:38,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-21 00:34:38,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:34:38,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-21 00:34:38,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-21 00:34:38,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:38,493 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:34:38,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 20.454545454545453) internal successors, (225), 11 states have internal predecessors, (225), 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-21 00:34:38,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:38,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:38,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:38,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:38,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:38,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:38,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:38,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:34:38,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:34:38,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-21 00:34:38,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:34:38,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:38,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:38,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:38,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-21 00:34:38,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:40,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:40,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:40,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:40,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:40,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:40,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:40,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:40,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:34:40,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:34:40,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-21 00:34:40,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:34:40,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:40,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:40,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:40,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:34:40,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:34:40,509 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-21 00:34:40,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-21 00:34:40,691 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-21 00:34:40,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:34:40,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1287547406, now seen corresponding path program 1 times [2024-11-21 00:34:40,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:34:40,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799323623] [2024-11-21 00:34:40,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:34:40,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:34:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:34:42,929 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 47 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-21 00:34:42,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:34:42,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799323623] [2024-11-21 00:34:42,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799323623] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:34:42,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916795880] [2024-11-21 00:34:42,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:34:42,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:34:42,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:34:42,932 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:34:42,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-21 00:34:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:34:43,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-21 00:34:43,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:34:43,546 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-21 00:34:43,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:34:43,592 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 18 treesize of output 13 [2024-11-21 00:34:43,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:34:43,797 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 29 treesize of output 13 [2024-11-21 00:34:43,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-21 00:34:44,010 INFO L349 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2024-11-21 00:34:44,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 25 [2024-11-21 00:34:44,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:34:44,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2024-11-21 00:34:44,079 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 47 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-21 00:34:44,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 00:34:44,926 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_655 (Array Int Int)) (v_ArrVal_660 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_49| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_655) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_49|) |c_~#queue~0.offset|) v_ArrVal_660) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_49|)))) is different from false [2024-11-21 00:34:44,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:34:44,946 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 53 treesize of output 43 [2024-11-21 00:34:44,956 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:34:44,956 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 78 treesize of output 80 [2024-11-21 00:34:44,964 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 61 treesize of output 53 [2024-11-21 00:34:44,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-21 00:34:45,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:34:45,059 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 48 treesize of output 44 [2024-11-21 00:34:45,244 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 47 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-21 00:34:45,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916795880] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 00:34:45,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 00:34:45,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 29 [2024-11-21 00:34:45,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300434550] [2024-11-21 00:34:45,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 00:34:45,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-21 00:34:45,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:34:45,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-21 00:34:45,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=703, Unknown=1, NotChecked=54, Total=870 [2024-11-21 00:34:45,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:45,251 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:34:45,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.633333333333333) internal successors, (259), 29 states have internal predecessors, (259), 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-21 00:34:45,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:45,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:45,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:45,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:45,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:45,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:45,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:45,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:34:45,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:34:45,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-21 00:34:45,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:34:45,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:45,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:45,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:45,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:34:45,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:34:45,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:47,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:47,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:47,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:47,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:47,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:47,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:47,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:47,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:34:47,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:34:47,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-21 00:34:47,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:34:47,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:47,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:47,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:47,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:34:47,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:34:47,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-21 00:34:47,619 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-21 00:34:47,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-21 00:34:47,803 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-21 00:34:47,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:34:47,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1301774970, now seen corresponding path program 1 times [2024-11-21 00:34:47,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:34:47,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705739103] [2024-11-21 00:34:47,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:34:47,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:34:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:34:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-21 00:34:51,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:34:51,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705739103] [2024-11-21 00:34:51,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705739103] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:34:51,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142197620] [2024-11-21 00:34:51,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:34:51,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:34:51,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:34:51,058 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:34:51,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-21 00:34:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:34:51,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-21 00:34:51,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:34:51,763 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-21 00:34:51,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:34:51,831 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 16 treesize of output 11 [2024-11-21 00:34:52,161 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-21 00:34:52,317 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 26 treesize of output 21 [2024-11-21 00:34:52,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:34:52,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:34:52,591 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 34 treesize of output 21 [2024-11-21 00:34:52,632 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 30 treesize of output 21 [2024-11-21 00:34:52,706 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 30 treesize of output 14 [2024-11-21 00:34:52,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:34:52,759 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 16 treesize of output 11 [2024-11-21 00:34:52,878 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-21 00:34:52,908 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-21 00:34:52,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 00:34:53,016 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_813 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_813) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20))) is different from false [2024-11-21 00:34:57,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:34:57,148 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 111 treesize of output 81 [2024-11-21 00:34:57,356 INFO L349 Elim1Store]: treesize reduction 207, result has 38.4 percent of original size [2024-11-21 00:34:57,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 154 treesize of output 235 [2024-11-21 00:34:57,443 INFO L349 Elim1Store]: treesize reduction 13, result has 66.7 percent of original size [2024-11-21 00:34:57,443 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 129 treesize of output 128 [2024-11-21 00:34:57,459 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 36 treesize of output 28 [2024-11-21 00:34:57,475 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 22 treesize of output 18 [2024-11-21 00:34:57,862 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-21 00:34:57,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142197620] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 00:34:57,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 00:34:57,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 18] total 47 [2024-11-21 00:34:57,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478070991] [2024-11-21 00:34:57,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 00:34:57,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-21 00:34:57,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:34:57,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-21 00:34:57,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1776, Unknown=23, NotChecked=90, Total=2256 [2024-11-21 00:34:57,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:34:57,867 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:34:57,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 6.041666666666667) internal successors, (290), 47 states have internal predecessors, (290), 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-21 00:34:57,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:57,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:57,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:57,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:57,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:57,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:57,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:34:57,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:34:57,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:34:57,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-21 00:34:57,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:34:57,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:57,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:57,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:34:57,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:34:57,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:34:57,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-21 00:34:57,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:35:02,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:35:02,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:35:02,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:35:02,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:35:02,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:35:02,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:35:02,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:35:02,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:35:02,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:35:02,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-21 00:35:02,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:35:02,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:35:02,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:35:02,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:35:02,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:35:02,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:35:02,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-21 00:35:02,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-21 00:35:02,331 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-21 00:35:02,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-21 00:35:02,515 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-21 00:35:02,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:35:02,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1863281922, now seen corresponding path program 2 times [2024-11-21 00:35:02,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:35:02,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143818830] [2024-11-21 00:35:02,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:35:02,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:35:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:35:06,048 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-21 00:35:06,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:35:06,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143818830] [2024-11-21 00:35:06,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143818830] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:35:06,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116016158] [2024-11-21 00:35:06,049 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 00:35:06,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:35:06,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:35:06,053 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:35:06,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-21 00:35:06,498 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 00:35:06,498 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 00:35:06,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-21 00:35:06,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:35:06,588 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-21 00:35:06,652 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-21 00:35:06,913 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 30 treesize of output 21 [2024-11-21 00:35:06,954 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 30 treesize of output 14 [2024-11-21 00:35:07,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-21 00:35:07,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:35:07,137 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 16 treesize of output 11 [2024-11-21 00:35:07,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:35:07,280 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 11 [2024-11-21 00:35:07,298 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-21 00:35:07,331 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-21 00:35:07,332 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 00:35:07,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116016158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:35:07,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 00:35:07,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 26 [2024-11-21 00:35:07,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634331520] [2024-11-21 00:35:07,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:35:07,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-21 00:35:07,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:35:07,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-21 00:35:07,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2024-11-21 00:35:07,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:35:07,335 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:35:07,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 13 states have internal predecessors, (80), 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-21 00:35:07,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:35:07,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:35:07,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:35:07,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:35:07,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:35:07,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:35:07,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:35:07,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:35:07,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:35:07,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-21 00:35:07,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:35:07,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:35:07,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:35:07,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:35:07,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:35:07,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:35:07,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-21 00:35:07,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-11-21 00:35:07,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:35:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:35:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:35:08,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:35:08,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:35:08,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:35:08,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:35:08,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:35:08,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:35:08,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:35:08,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-21 00:35:08,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:35:08,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:35:08,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:35:08,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:35:08,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:35:08,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:35:08,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-21 00:35:08,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-21 00:35:08,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:35:08,528 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-21 00:35:08,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:35:08,708 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-21 00:35:08,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:35:08,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1576041332, now seen corresponding path program 1 times [2024-11-21 00:35:08,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:35:08,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734817820] [2024-11-21 00:35:08,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:35:08,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:35:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:35:11,290 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-21 00:35:11,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:35:11,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734817820] [2024-11-21 00:35:11,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734817820] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:35:11,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279962861] [2024-11-21 00:35:11,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:35:11,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:35:11,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:35:11,293 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:35:11,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-21 00:35:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:35:11,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 90 conjuncts are in the unsatisfiable core [2024-11-21 00:35:11,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:35:11,692 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-21 00:35:11,751 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-21 00:35:12,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:35:12,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:35:12,061 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 34 treesize of output 21 [2024-11-21 00:35:12,115 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 30 treesize of output 14 [2024-11-21 00:35:12,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-21 00:35:12,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:35:12,317 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 16 treesize of output 11 [2024-11-21 00:35:12,524 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-21 00:35:12,560 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-21 00:35:12,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-21 00:35:12,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:35:12,752 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 16 treesize of output 11 [2024-11-21 00:35:13,146 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-21 00:35:13,192 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-21 00:35:13,438 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-21 00:35:13,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 00:35:14,145 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1080 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1080) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1080 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1080) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2024-11-21 00:35:14,158 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1080 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1080) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1080 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1080) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2024-11-21 00:35:16,005 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ (* (select .cse3 .cse2) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1075 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1077 Int)) (<= (+ (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_1075))) (store (store .cse0 .cse1 v_ArrVal_1077) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1080) |c_~#queue~0.base|) .cse5)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1075 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1077 Int)) (<= 0 (+ (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_1075))) (store (store .cse6 .cse1 v_ArrVal_1077) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1080) |c_~#queue~0.base|) .cse5)) |c_~#queue~0.offset|)))))) is different from false [2024-11-21 00:35:18,039 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1075 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1077 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_1075))) (store (store .cse0 .cse1 v_ArrVal_1077) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1080) |c_~#queue~0.base|) .cse2) 4)))) (forall ((v_ArrVal_1075 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1077 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse3 .cse4 v_ArrVal_1075))) (store (store .cse5 .cse1 v_ArrVal_1077) .cse2 (+ (select .cse5 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1080) |c_~#queue~0.base|) .cse2) 4)) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2024-11-21 00:35:29,377 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1075 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1077 Int) (v_ArrVal_1074 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (let ((.cse4 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1074) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1075)))) (store (store .cse1 .cse2 v_ArrVal_1077) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1080) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1075 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1077 Int) (v_ArrVal_1074 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse5 (let ((.cse6 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1074) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1075)))) (store (store .cse5 .cse2 v_ArrVal_1077) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1080) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2024-11-21 00:35:29,421 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 1))))) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1075 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1077 Int) (v_ArrVal_1074 (Array Int Int))) (<= (+ (* 4 (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (let ((.cse4 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1074) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1075)))) (store (store .cse1 .cse2 v_ArrVal_1077) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1080) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1075 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1077 Int) (v_ArrVal_1074 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse5 (let ((.cse6 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1074) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1075)))) (store (store .cse5 .cse2 v_ArrVal_1077) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1080) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset|))))) is different from false [2024-11-21 00:35:29,515 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse8 (+ (select .cse5 .cse7) 1)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1075 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1077 Int) (v_ArrVal_1074 (Array Int Int)) (v_ArrVal_1071 Int)) (<= (+ (* 4 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1071) .cse7 .cse8)))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (let ((.cse4 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1074) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1075)))) (store (store .cse1 .cse2 v_ArrVal_1077) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1080) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1075 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1077 Int) (v_ArrVal_1074 (Array Int Int)) (v_ArrVal_1071 Int)) (<= 0 (+ (* 4 (select (select (store (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1071) .cse7 .cse8)))) (store .cse9 |c_~#queue~0.base| (let ((.cse10 (let ((.cse11 (select (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_1074) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1075)))) (store (store .cse10 .cse2 v_ArrVal_1077) .cse3 (+ (select .cse10 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1080) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset|)))))) is different from false [2024-11-21 00:35:29,608 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1075 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1077 Int) (v_ArrVal_1074 (Array Int Int)) (v_ArrVal_1071 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store .cse8 .cse9 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse5 .cse6 v_ArrVal_1071) .cse7 (+ (select .cse5 .cse7) 1)))))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (let ((.cse4 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1074) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1075)))) (store (store .cse1 .cse2 v_ArrVal_1077) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1080) |c_~#queue~0.base|) .cse3) 4)))) (forall ((v_ArrVal_1075 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1077 Int) (v_ArrVal_1074 (Array Int Int)) (v_ArrVal_1071 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (store .cse8 .cse9 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse13 .cse6 v_ArrVal_1071) .cse7 (+ (select .cse13 .cse7) 1)))))) (store .cse10 |c_~#queue~0.base| (let ((.cse11 (let ((.cse12 (select (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_1074) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1075)))) (store (store .cse11 .cse2 v_ArrVal_1077) .cse3 (+ (select .cse11 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1080) |c_~#queue~0.base|) .cse3) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2024-11-21 00:35:29,674 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse9 (select .cse8 .cse7))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| Int)) (or (forall ((v_ArrVal_1075 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1077 Int) (v_ArrVal_1074 (Array Int Int)) (v_ArrVal_1071 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse5 .cse6 v_ArrVal_1071) .cse7 (+ (select .cse5 .cse7) 1)))))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (let ((.cse4 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1074) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse3) 4)) v_ArrVal_1075)))) (store (store .cse1 .cse2 v_ArrVal_1077) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1080) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| Int)) (or (forall ((v_ArrVal_1075 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1077 Int) (v_ArrVal_1074 (Array Int Int)) (v_ArrVal_1071 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ (* (select (select (store (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse13 .cse6 v_ArrVal_1071) .cse7 (+ (select .cse13 .cse7) 1)))))) (store .cse10 |c_~#queue~0.base| (let ((.cse11 (let ((.cse12 (select (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_1074) |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse3) 4)) v_ArrVal_1075)))) (store (store .cse11 .cse2 v_ArrVal_1077) .cse3 (+ (select .cse11 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1080) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|)))))) is different from false [2024-11-21 00:35:54,570 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) 0)))) (let ((.cse6 (select .cse0 |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse7 (select .cse6 .cse3))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| Int)) (or (forall ((v_ArrVal_1075 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1077 Int) (v_ArrVal_1074 (Array Int Int)) (v_ArrVal_1071 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (let ((.cse4 (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse5 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse5 .cse2 v_ArrVal_1071) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1074) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1075)))) (store (store .cse1 .cse2 v_ArrVal_1077) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1080) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< .cse7 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| Int)) (or (forall ((v_ArrVal_1075 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1077 Int) (v_ArrVal_1074 (Array Int Int)) (v_ArrVal_1071 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse8 (let ((.cse9 (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse10 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse10 .cse2 v_ArrVal_1071) .cse3 (+ (select .cse10 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1074) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1075)))) (store (store .cse8 .cse2 v_ArrVal_1077) .cse3 (+ (select .cse8 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1080) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (< .cse7 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|))))))) is different from false [2024-11-21 00:35:55,019 INFO L349 Elim1Store]: treesize reduction 306, result has 39.5 percent of original size [2024-11-21 00:35:55,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 499 treesize of output 363 [2024-11-21 00:35:55,070 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-21 00:35:55,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 290 treesize of output 268 [2024-11-21 00:35:55,288 INFO L349 Elim1Store]: treesize reduction 64, result has 54.0 percent of original size [2024-11-21 00:35:55,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 116 treesize of output 176 [2024-11-21 00:35:55,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:35:55,360 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 233 treesize of output 233 [2024-11-21 00:35:55,545 INFO L349 Elim1Store]: treesize reduction 64, result has 24.7 percent of original size [2024-11-21 00:35:55,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 184 treesize of output 126 [2024-11-21 00:35:55,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:35:55,641 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 94 treesize of output 87 [2024-11-21 00:35:55,672 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 42 treesize of output 34 [2024-11-21 00:35:55,825 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 9 [2024-11-21 00:35:56,072 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 9 [2024-11-21 00:35:56,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:35:56,118 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 95 treesize of output 97 [2024-11-21 00:35:56,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:35:56,444 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 168 treesize of output 154 [2024-11-21 00:35:56,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:35:56,753 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:35:56,990 INFO L349 Elim1Store]: treesize reduction 257, result has 31.5 percent of original size [2024-11-21 00:35:56,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 476 treesize of output 258 [2024-11-21 00:35:57,002 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:35:57,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:35:57,009 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 140 [2024-11-21 00:35:57,019 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:35:57,020 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:35:57,022 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:35:57,023 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:35:57,028 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:35:57,829 INFO L349 Elim1Store]: treesize reduction 369, result has 26.1 percent of original size [2024-11-21 00:35:57,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 189 treesize of output 279 [2024-11-21 00:35:57,850 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:35:57,857 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 104 [2024-11-21 00:35:57,901 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:35:57,902 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:35:57,917 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:35:57,926 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:35:57,930 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:35:57,931 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:35:57,932 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:35:57,936 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:35:58,171 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-21 00:35:58,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 1147 treesize of output 981 [2024-11-21 00:35:58,213 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:35:58,259 INFO L349 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2024-11-21 00:35:58,259 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 85 treesize of output 65 [2024-11-21 00:35:58,773 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 10 not checked. [2024-11-21 00:35:58,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279962861] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 00:35:58,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 00:35:58,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 21] total 58 [2024-11-21 00:35:58,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697711865] [2024-11-21 00:35:58,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 00:35:58,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-21 00:35:58,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:35:58,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-21 00:35:58,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2075, Unknown=58, NotChecked=1030, Total=3422 [2024-11-21 00:35:58,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:35:58,777 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:35:58,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 3.6271186440677967) internal successors, (214), 58 states have internal predecessors, (214), 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-21 00:35:58,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:35:58,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:35:58,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:35:58,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:35:58,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:35:58,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:35:58,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:35:58,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:35:58,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:35:58,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-21 00:35:58,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:35:58,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:35:58,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:35:58,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:35:58,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:35:58,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:35:58,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-21 00:35:58,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-21 00:35:58,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:35:58,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:36:08,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:36:10,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:36:10,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:36:10,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:36:10,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:36:10,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:36:10,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:36:10,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:36:10,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:36:10,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:36:10,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-21 00:36:10,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:36:10,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:36:10,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:36:10,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:36:10,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:36:10,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:36:10,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-21 00:36:10,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-21 00:36:10,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:36:10,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-21 00:36:10,513 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-21 00:36:10,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:36:10,686 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-21 00:36:10,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:36:10,687 INFO L85 PathProgramCache]: Analyzing trace with hash -876871733, now seen corresponding path program 3 times [2024-11-21 00:36:10,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:36:10,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500571584] [2024-11-21 00:36:10,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:36:10,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:36:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:36:13,948 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 25 proven. 51 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-21 00:36:13,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:36:13,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500571584] [2024-11-21 00:36:13,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500571584] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:36:13,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535942604] [2024-11-21 00:36:13,948 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-21 00:36:13,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:36:13,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:36:13,950 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:36:13,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-21 00:36:14,850 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-21 00:36:14,850 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 00:36:14,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 107 conjuncts are in the unsatisfiable core [2024-11-21 00:36:14,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:36:14,945 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-21 00:36:15,020 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-21 00:36:15,373 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 30 treesize of output 21 [2024-11-21 00:36:15,435 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 30 treesize of output 14 [2024-11-21 00:36:15,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-21 00:36:15,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:36:15,719 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 16 treesize of output 11 [2024-11-21 00:36:16,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:36:16,022 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 11 [2024-11-21 00:36:16,062 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-21 00:36:16,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-21 00:36:16,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:36:16,311 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 16 treesize of output 11 [2024-11-21 00:36:16,695 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-21 00:36:16,763 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-21 00:36:17,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:36:17,021 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 11 [2024-11-21 00:36:17,056 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-21 00:36:17,130 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 48 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-21 00:36:17,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 00:36:18,669 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1281 Int) (v_ArrVal_1276 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1276) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1281) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|)))) is different from false [2024-11-21 00:36:18,703 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1281 Int) (v_ArrVal_1276 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1276) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1281) .cse1) 20))))) is different from false [2024-11-21 00:36:18,780 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1281 Int) (v_ArrVal_1273 Int) (v_ArrVal_1276 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1273) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1276) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1281) .cse1) 20))))) is different from false [2024-11-21 00:36:18,848 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1271 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1281 Int) (v_ArrVal_1273 Int) (v_ArrVal_1276 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1271)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1273) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1276) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1281) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|)))) is different from false [2024-11-21 00:36:18,907 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_96| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_96|) (forall ((v_ArrVal_1271 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1281 Int) (v_ArrVal_1273 Int) (v_ArrVal_1276 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse4 (store .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_96|)) v_ArrVal_1271))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1273) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1276) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1281) .cse3) 20)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|))))))) is different from false [2024-11-21 00:36:20,036 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1271 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1281 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_96| Int) (v_ArrVal_1273 Int) (v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1270) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_96|)) v_ArrVal_1271))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1273) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1276) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1281) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_96|)))))) is different from false [2024-11-21 00:36:20,193 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1271 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1281 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_96| Int) (v_ArrVal_1273 Int) (v_ArrVal_1267 Int) (v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1267) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1270) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_96|)) v_ArrVal_1271))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1273) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1276) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1281) .cse1) 20)) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_96|)))))) is different from false [2024-11-21 00:36:23,385 INFO L349 Elim1Store]: treesize reduction 306, result has 39.5 percent of original size [2024-11-21 00:36:23,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 646 treesize of output 413 [2024-11-21 00:36:23,443 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-21 00:36:23,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 401 treesize of output 377 [2024-11-21 00:36:23,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:36:23,490 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 304 treesize of output 304 [2024-11-21 00:36:23,530 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 91 treesize of output 83 [2024-11-21 00:36:23,553 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 13 treesize of output 9 [2024-11-21 00:36:23,607 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 9 [2024-11-21 00:36:23,996 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 9 [2024-11-21 00:36:24,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:36:24,046 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 84 treesize of output 86 [2024-11-21 00:36:24,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:36:24,421 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 225 treesize of output 211 [2024-11-21 00:36:24,955 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 48 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-21 00:36:24,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535942604] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 00:36:24,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 00:36:24,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 24] total 53 [2024-11-21 00:36:24,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026079589] [2024-11-21 00:36:24,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 00:36:24,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-21 00:36:24,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:36:24,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-21 00:36:24,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=1864, Unknown=26, NotChecked=672, Total=2862 [2024-11-21 00:36:24,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:36:24,959 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:36:24,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.962962962962963) internal successors, (322), 53 states have internal predecessors, (322), 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-21 00:36:24,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:36:24,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:36:24,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:36:24,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:36:24,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:36:24,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:36:24,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:36:24,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:36:24,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:36:24,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-21 00:36:24,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:36:24,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:36:24,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:36:24,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:36:24,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:36:24,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:36:24,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-21 00:36:24,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-21 00:36:24,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:36:24,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-11-21 00:36:24,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:36:34,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:36:39,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:36:39,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:36:39,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:36:39,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:36:39,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:36:39,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:36:39,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:36:39,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:36:39,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:36:39,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-21 00:36:39,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:36:39,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:36:39,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:36:39,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:36:39,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:36:39,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:36:39,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-21 00:36:39,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-21 00:36:39,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:36:39,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-21 00:36:39,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-21 00:36:39,634 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-21 00:36:39,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:36:39,817 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-21 00:36:39,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:36:39,818 INFO L85 PathProgramCache]: Analyzing trace with hash 129823799, now seen corresponding path program 1 times [2024-11-21 00:36:39,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:36:39,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619064637] [2024-11-21 00:36:39,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:36:39,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:36:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:36:44,930 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-21 00:36:44,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:36:44,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619064637] [2024-11-21 00:36:44,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619064637] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:36:44,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228412826] [2024-11-21 00:36:44,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:36:44,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:36:44,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:36:44,933 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:36:44,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-21 00:36:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:36:45,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 840 conjuncts, 122 conjuncts are in the unsatisfiable core [2024-11-21 00:36:45,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:36:45,438 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-21 00:36:45,565 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-21 00:36:46,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:36:46,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:36:46,059 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 34 treesize of output 21 [2024-11-21 00:36:46,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-21 00:36:46,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-21 00:36:46,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:36:46,539 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 16 treesize of output 11 [2024-11-21 00:36:46,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:36:46,924 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 11 [2024-11-21 00:36:46,976 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-21 00:36:47,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-21 00:36:47,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:36:47,296 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 16 treesize of output 11 [2024-11-21 00:36:47,865 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-21 00:36:47,963 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-21 00:36:48,353 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-21 00:36:48,395 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-21 00:36:48,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-21 00:36:48,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:36:48,729 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 16 treesize of output 11 [2024-11-21 00:36:49,092 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-21 00:36:49,144 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-21 00:36:49,562 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 31 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-21 00:36:49,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 00:36:53,859 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1442 Int) (v_ArrVal_1441 Int)) (<= (+ (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_1441))) (store (store .cse0 .cse1 v_ArrVal_1442) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse5)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1442 Int) (v_ArrVal_1441 Int)) (<= 0 (+ (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_1441))) (store (store .cse6 .cse1 v_ArrVal_1442) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse5)) |c_~#queue~0.offset|))))) is different from false [2024-11-21 00:36:55,940 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ (* (select .cse3 .cse2) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1442 Int) (v_ArrVal_1441 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_1441))) (store (store .cse0 .cse1 v_ArrVal_1442) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse5) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1442 Int) (v_ArrVal_1441 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_1441))) (store (store .cse6 .cse1 v_ArrVal_1442) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse5) 4))))))) is different from false [2024-11-21 00:36:58,004 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1442 Int) (v_ArrVal_1441 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_1441))) (store (store .cse0 .cse1 v_ArrVal_1442) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1442 Int) (v_ArrVal_1441 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse3 .cse4 v_ArrVal_1441))) (store (store .cse5 .cse1 v_ArrVal_1442) .cse2 (+ (select .cse5 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset|)))))) is different from false [2024-11-21 00:38:45,396 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse3 (+ (* (select .cse0 .cse5) 4) |c_~#queue~0.offset|))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1442 Int) (v_ArrVal_1441 Int) (v_ArrVal_1437 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1))) (store (store (store (store .cse0 .cse1 .cse2) .cse3 v_ArrVal_1441) .cse4 v_ArrVal_1442) .cse5 (+ (select (store (store (store .cse0 .cse4 v_ArrVal_1437) .cse1 .cse2) .cse3 v_ArrVal_1441) .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1442 Int) (v_ArrVal_1441 Int) (v_ArrVal_1437 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse6 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1))) (store (store (store (store .cse0 .cse1 .cse6) .cse3 v_ArrVal_1441) .cse4 v_ArrVal_1442) .cse5 (+ (select (store (store (store .cse0 .cse4 v_ArrVal_1437) .cse1 .cse6) .cse3 v_ArrVal_1441) .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2024-11-21 00:38:45,860 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 80)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1442 Int) (v_ArrVal_1441 Int) (v_ArrVal_1437 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1436) |c_~#queue~0.base|))) (let ((.cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse3 (+ (* (select .cse0 .cse5) 4) |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse1 .cse2) .cse3 v_ArrVal_1441) .cse4 v_ArrVal_1442) .cse5 (+ (select (store (store (store .cse0 .cse4 v_ArrVal_1437) .cse1 .cse2) .cse3 v_ArrVal_1441) .cse5) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse5) 4)))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1442 Int) (v_ArrVal_1441 Int) (v_ArrVal_1437 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse6 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1436) |c_~#queue~0.base|))) (let ((.cse7 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse8 (+ (* (select .cse6 .cse5) 4) |c_~#queue~0.offset|))) (store (store (store (store .cse6 .cse1 .cse7) .cse8 v_ArrVal_1441) .cse4 v_ArrVal_1442) .cse5 (+ (select (store (store (store .cse6 .cse4 v_ArrVal_1437) .cse1 .cse7) .cse8 v_ArrVal_1441) .cse5) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse5) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2024-11-21 00:38:48,910 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse10 .cse11 (+ (select .cse10 .cse11) 1))))) (.cse6 (+ 84 |c_~#queue~0.offset|))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1442 Int) (v_ArrVal_1441 Int) (v_ArrVal_1437 Int)) (<= 0 (+ (* 4 (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1436) |c_~#queue~0.base|))) (let ((.cse3 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse4 (+ (* (select .cse1 .cse6) 4) |c_~#queue~0.offset|))) (store (store (store (store .cse1 .cse2 .cse3) .cse4 v_ArrVal_1441) .cse5 v_ArrVal_1442) .cse6 (+ (select (store (store (store .cse1 .cse5 v_ArrVal_1437) .cse2 .cse3) .cse4 v_ArrVal_1441) .cse6) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse6)) |c_~#queue~0.offset|))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1442 Int) (v_ArrVal_1441 Int) (v_ArrVal_1437 Int)) (<= (+ (* 4 (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse7 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1436) |c_~#queue~0.base|))) (let ((.cse8 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse9 (+ (* (select .cse7 .cse6) 4) |c_~#queue~0.offset|))) (store (store (store (store .cse7 .cse2 .cse8) .cse9 v_ArrVal_1441) .cse5 v_ArrVal_1442) .cse6 (+ (select (store (store (store .cse7 .cse5 v_ArrVal_1437) .cse2 .cse8) .cse9 v_ArrVal_1441) .cse6) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse6)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2024-11-21 00:38:49,022 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse10 (+ (select .cse7 .cse9) 1)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1442 Int) (v_ArrVal_1441 Int) (v_ArrVal_1434 Int) (v_ArrVal_1437 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 .cse8 v_ArrVal_1434) .cse9 .cse10)))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1436) |c_~#queue~0.base|))) (let ((.cse3 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse4 (+ (* (select .cse1 .cse6) 4) |c_~#queue~0.offset|))) (store (store (store (store .cse1 .cse2 .cse3) .cse4 v_ArrVal_1441) .cse5 v_ArrVal_1442) .cse6 (+ (select (store (store (store .cse1 .cse5 v_ArrVal_1437) .cse2 .cse3) .cse4 v_ArrVal_1441) .cse6) 1)))))) |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse6) 4)))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1442 Int) (v_ArrVal_1441 Int) (v_ArrVal_1434 Int) (v_ArrVal_1437 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (let ((.cse11 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 .cse8 v_ArrVal_1434) .cse9 .cse10)))) (store .cse11 |c_~#queue~0.base| (let ((.cse12 (select (store .cse11 |c_~#stored_elements~0.base| v_ArrVal_1436) |c_~#queue~0.base|))) (let ((.cse13 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse14 (+ (* (select .cse12 .cse6) 4) |c_~#queue~0.offset|))) (store (store (store (store .cse12 .cse2 .cse13) .cse14 v_ArrVal_1441) .cse5 v_ArrVal_1442) .cse6 (+ (select (store (store (store .cse12 .cse5 v_ArrVal_1437) .cse2 .cse13) .cse14 v_ArrVal_1441) .cse6) 1)))))) |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse6) 4)) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2024-11-21 00:38:49,105 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1431 Int) (v_ArrVal_1442 Int) (v_ArrVal_1441 Int) (v_ArrVal_1434 Int) (v_ArrVal_1437 Int)) (<= 0 (+ (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (store .cse10 .cse11 v_ArrVal_1431))) (store (store .cse7 .cse8 v_ArrVal_1434) .cse9 (+ (select .cse7 .cse9) 1)))))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1436) |c_~#queue~0.base|))) (let ((.cse3 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse4 (+ (* 4 (select .cse1 .cse6)) |c_~#queue~0.offset|))) (store (store (store (store .cse1 .cse2 .cse3) .cse4 v_ArrVal_1441) .cse5 v_ArrVal_1442) .cse6 (+ (select (store (store (store .cse1 .cse5 v_ArrVal_1437) .cse2 .cse3) .cse4 v_ArrVal_1441) .cse6) 1)))))) |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset|))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1431 Int) (v_ArrVal_1442 Int) (v_ArrVal_1441 Int) (v_ArrVal_1434 Int) (v_ArrVal_1437 Int)) (<= (+ (* (select (select (store (let ((.cse12 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse16 (store .cse10 .cse11 v_ArrVal_1431))) (store (store .cse16 .cse8 v_ArrVal_1434) .cse9 (+ (select .cse16 .cse9) 1)))))) (store .cse12 |c_~#queue~0.base| (let ((.cse13 (select (store .cse12 |c_~#stored_elements~0.base| v_ArrVal_1436) |c_~#queue~0.base|))) (let ((.cse14 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse15 (+ (* 4 (select .cse13 .cse6)) |c_~#queue~0.offset|))) (store (store (store (store .cse13 .cse2 .cse14) .cse15 v_ArrVal_1441) .cse5 v_ArrVal_1442) .cse6 (+ (select (store (store (store .cse13 .cse5 v_ArrVal_1437) .cse2 .cse14) .cse15 v_ArrVal_1441) .cse6) 1)))))) |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2024-11-21 00:38:49,183 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse6 (+ 84 |c_~#queue~0.offset|)) (.cse11 (select .cse10 .cse9))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int)) (or (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1431 Int) (v_ArrVal_1442 Int) (v_ArrVal_1441 Int) (v_ArrVal_1434 Int) (v_ArrVal_1437 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1431))) (store (store .cse7 .cse8 v_ArrVal_1434) .cse9 (+ (select .cse7 .cse9) 1)))))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1436) |c_~#queue~0.base|))) (let ((.cse3 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse4 (+ (* (select .cse1 .cse6) 4) |c_~#queue~0.offset|))) (store (store (store (store .cse1 .cse2 .cse3) .cse4 v_ArrVal_1441) .cse5 v_ArrVal_1442) .cse6 (+ (select (store (store (store .cse1 .cse5 v_ArrVal_1437) .cse2 .cse3) .cse4 v_ArrVal_1441) .cse6) 1)))))) |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse6) 4)) (select |c_#length| |c_~#queue~0.base|))) (< .cse11 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int)) (or (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1431 Int) (v_ArrVal_1442 Int) (v_ArrVal_1441 Int) (v_ArrVal_1434 Int) (v_ArrVal_1437 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse12 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse16 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1431))) (store (store .cse16 .cse8 v_ArrVal_1434) .cse9 (+ (select .cse16 .cse9) 1)))))) (store .cse12 |c_~#queue~0.base| (let ((.cse13 (select (store .cse12 |c_~#stored_elements~0.base| v_ArrVal_1436) |c_~#queue~0.base|))) (let ((.cse14 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse15 (+ (* (select .cse13 .cse6) 4) |c_~#queue~0.offset|))) (store (store (store (store .cse13 .cse2 .cse14) .cse15 v_ArrVal_1441) .cse5 v_ArrVal_1442) .cse6 (+ (select (store (store (store .cse13 .cse5 v_ArrVal_1437) .cse2 .cse14) .cse15 v_ArrVal_1441) .cse6) 1)))))) |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse6) 4)))) (< .cse11 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|)))))) is different from false [2024-11-21 00:39:15,528 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#queue~0.offset| 80)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1430 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1430) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1431 Int) (v_ArrVal_1442 Int) (v_ArrVal_1441 Int) (v_ArrVal_1434 Int) (v_ArrVal_1437 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1431))) (store (store .cse7 .cse6 v_ArrVal_1434) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1436) |c_~#queue~0.base|))) (let ((.cse4 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse5 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|))) (store (store (store (store .cse2 .cse3 .cse4) .cse5 v_ArrVal_1441) .cse6 v_ArrVal_1442) .cse1 (+ (select (store (store (store .cse2 .cse6 v_ArrVal_1437) .cse3 .cse4) .cse5 v_ArrVal_1441) .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1430 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1430) |c_~#queue~0.base|))) (or (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1431 Int) (v_ArrVal_1442 Int) (v_ArrVal_1441 Int) (v_ArrVal_1434 Int) (v_ArrVal_1437 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse11 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1431))) (store (store .cse11 .cse6 v_ArrVal_1434) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1436) |c_~#queue~0.base|))) (let ((.cse9 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse10 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|))) (store (store (store (store .cse8 .cse3 .cse9) .cse10 v_ArrVal_1441) .cse6 v_ArrVal_1442) .cse1 (+ (select (store (store (store .cse8 .cse6 v_ArrVal_1437) .cse3 .cse9) .cse10 v_ArrVal_1441) .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (< (select .cse12 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|)))))) is different from false [2024-11-21 00:39:15,754 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_~#queue~0.offset| 80)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1430 (Array Int Int))) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1430) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1431 Int) (v_ArrVal_1442 Int) (v_ArrVal_1441 Int) (v_ArrVal_1434 Int) (v_ArrVal_1437 Int)) (<= (+ (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse8 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1431))) (store (store .cse8 .cse7 v_ArrVal_1434) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1436) |c_~#queue~0.base|))) (let ((.cse5 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse6 (+ |c_~#queue~0.offset| (* 4 (select .cse3 .cse1))))) (store (store (store (store .cse3 .cse4 .cse5) .cse6 v_ArrVal_1441) .cse7 v_ArrVal_1442) .cse1 (+ (select (store (store (store .cse3 .cse7 v_ArrVal_1437) .cse4 .cse5) .cse6 v_ArrVal_1441) .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1430 (Array Int Int))) (let ((.cse13 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1430) |c_~#queue~0.base|))) (or (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1431 Int) (v_ArrVal_1442 Int) (v_ArrVal_1441 Int) (v_ArrVal_1434 Int) (v_ArrVal_1437 Int)) (<= 0 (+ (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse9 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse12 (store .cse13 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1431))) (store (store .cse12 .cse7 v_ArrVal_1434) .cse1 (+ (select .cse12 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1436) |c_~#queue~0.base|))) (let ((.cse10 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse11 (+ |c_~#queue~0.offset| (* 4 (select .cse9 .cse1))))) (store (store (store (store .cse9 .cse4 .cse10) .cse11 v_ArrVal_1441) .cse7 v_ArrVal_1442) .cse1 (+ (select (store (store (store .cse9 .cse7 v_ArrVal_1437) .cse4 .cse10) .cse11 v_ArrVal_1441) .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (< (select .cse13 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|)))))) is different from false [2024-11-21 00:39:15,836 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#queue~0.offset| 80)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse6 (+ 84 |c_~#queue~0.offset|)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse14 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse15 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse14 .cse15 (+ (select .cse14 .cse15) 1)))))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1430 (Array Int Int))) (let ((.cse8 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1430) |c_~#queue~0.base|))) (or (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1431 Int) (v_ArrVal_1442 Int) (v_ArrVal_1441 Int) (v_ArrVal_1434 Int) (v_ArrVal_1437 Int)) (<= (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1431))) (store (store .cse7 .cse5 v_ArrVal_1434) .cse6 (+ (select .cse7 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1436) |c_~#queue~0.base|))) (let ((.cse3 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse4 (+ |c_~#queue~0.offset| (* (select .cse1 .cse6) 4)))) (store (store (store (store .cse1 .cse2 .cse3) .cse4 v_ArrVal_1441) .cse5 v_ArrVal_1442) .cse6 (+ (select (store (store (store .cse1 .cse5 v_ArrVal_1437) .cse2 .cse3) .cse4 v_ArrVal_1441) .cse6) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse8 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1430 (Array Int Int))) (let ((.cse9 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1430) |c_~#queue~0.base|))) (or (< (select .cse9 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1431 Int) (v_ArrVal_1442 Int) (v_ArrVal_1441 Int) (v_ArrVal_1434 Int) (v_ArrVal_1437 Int)) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse10 (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse13 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1431))) (store (store .cse13 .cse5 v_ArrVal_1434) .cse6 (+ (select .cse13 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1436) |c_~#queue~0.base|))) (let ((.cse11 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse12 (+ |c_~#queue~0.offset| (* (select .cse10 .cse6) 4)))) (store (store (store (store .cse10 .cse2 .cse11) .cse12 v_ArrVal_1441) .cse5 v_ArrVal_1442) .cse6 (+ (select (store (store (store .cse10 .cse5 v_ArrVal_1437) .cse2 .cse11) .cse12 v_ArrVal_1441) .cse6) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset|)))))))) is different from false [2024-11-21 00:39:22,796 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (+ |c_~#queue~0.offset| 80)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse10 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse13 (select .cse12 .cse11))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| Int)) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1430 (Array Int Int)) (v_ArrVal_1428 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse9 .cse10 v_ArrVal_1428) .cse11 (+ (select .cse9 .cse11) 1)))))) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1430) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1431 Int) (v_ArrVal_1442 Int) (v_ArrVal_1441 Int) (v_ArrVal_1434 Int) (v_ArrVal_1437 Int)) (<= 0 (+ (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse8 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1431))) (store (store .cse8 .cse7 v_ArrVal_1434) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1436) |c_~#queue~0.base|))) (let ((.cse5 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse6 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|))) (store (store (store (store .cse3 .cse4 .cse5) .cse6 v_ArrVal_1441) .cse7 v_ArrVal_1442) .cse1 (+ (select (store (store (store .cse3 .cse7 v_ArrVal_1437) .cse4 .cse5) .cse6 v_ArrVal_1441) .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))))) (< .cse13 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| Int)) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1430 (Array Int Int)) (v_ArrVal_1428 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse14 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse20 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse20 .cse10 v_ArrVal_1428) .cse11 (+ (select .cse20 .cse11) 1)))))) (let ((.cse19 (select (store .cse14 |c_~#stored_elements~0.base| v_ArrVal_1430) |c_~#queue~0.base|))) (or (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1431 Int) (v_ArrVal_1442 Int) (v_ArrVal_1441 Int) (v_ArrVal_1434 Int) (v_ArrVal_1437 Int)) (<= (+ (* (select (select (store (store .cse14 |c_~#queue~0.base| (let ((.cse15 (select (store (store .cse14 |c_~#queue~0.base| (let ((.cse18 (store .cse19 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1431))) (store (store .cse18 .cse7 v_ArrVal_1434) .cse1 (+ (select .cse18 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1436) |c_~#queue~0.base|))) (let ((.cse16 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse17 (+ (* (select .cse15 .cse1) 4) |c_~#queue~0.offset|))) (store (store (store (store .cse15 .cse4 .cse16) .cse17 v_ArrVal_1441) .cse7 v_ArrVal_1442) .cse1 (+ (select (store (store (store .cse15 .cse7 v_ArrVal_1437) .cse4 .cse16) .cse17 v_ArrVal_1441) .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse19 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|))))) (< .cse13 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114|)))))) is different from false [2024-11-21 00:39:24,886 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse10 .cse6)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse5 (+ 88 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1430 (Array Int Int)) (v_ArrVal_1428 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse9 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse9 .cse5 v_ArrVal_1428) .cse6 (+ (select .cse9 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1430) |c_~#queue~0.base|))) (or (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1431 Int) (v_ArrVal_1442 Int) (v_ArrVal_1441 Int) (v_ArrVal_1434 Int) (v_ArrVal_1437 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1431))) (store (store .cse7 .cse5 v_ArrVal_1434) .cse6 (+ (select .cse7 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1436) |c_~#queue~0.base|))) (let ((.cse3 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse4 (+ (* 4 (select .cse1 .cse6)) |c_~#queue~0.offset|))) (store (store (store (store .cse1 .cse2 .cse3) .cse4 v_ArrVal_1441) .cse5 v_ArrVal_1442) .cse6 (+ (select (store (store (store .cse1 .cse5 v_ArrVal_1437) .cse2 .cse3) .cse4 v_ArrVal_1441) .cse6) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset|))) (< (select .cse8 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1430 (Array Int Int)) (v_ArrVal_1428 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse15 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse16 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse16 .cse5 v_ArrVal_1428) .cse6 (+ (select .cse16 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1430) |c_~#queue~0.base|))) (or (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1431 Int) (v_ArrVal_1442 Int) (v_ArrVal_1441 Int) (v_ArrVal_1434 Int) (v_ArrVal_1437 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse11 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse14 (store .cse15 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1431))) (store (store .cse14 .cse5 v_ArrVal_1434) .cse6 (+ (select .cse14 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1436) |c_~#queue~0.base|))) (let ((.cse12 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse13 (+ (* 4 (select .cse11 .cse6)) |c_~#queue~0.offset|))) (store (store (store (store .cse11 .cse2 .cse12) .cse13 v_ArrVal_1441) .cse5 v_ArrVal_1442) .cse6 (+ (select (store (store (store .cse11 .cse5 v_ArrVal_1437) .cse2 .cse12) .cse13 v_ArrVal_1441) .cse6) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse15 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|))))))))) is different from false [2024-11-21 00:39:27,576 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) 0)))) (let ((.cse10 (select .cse0 |c_~#queue~0.base|)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (let ((.cse11 (select .cse10 .cse6)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse5 (+ 88 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| Int)) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1430 (Array Int Int)) (v_ArrVal_1428 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse8 (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse9 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse9 .cse5 v_ArrVal_1428) .cse6 (+ (select .cse9 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1430) |c_~#queue~0.base|))) (or (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1431 Int) (v_ArrVal_1442 Int) (v_ArrVal_1441 Int) (v_ArrVal_1434 Int) (v_ArrVal_1437 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1431))) (store (store .cse7 .cse5 v_ArrVal_1434) .cse6 (+ (select .cse7 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1436) |c_~#queue~0.base|))) (let ((.cse3 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse4 (+ (* (select .cse1 .cse6) 4) |c_~#queue~0.offset|))) (store (store (store (store .cse1 .cse2 .cse3) .cse4 v_ArrVal_1441) .cse5 v_ArrVal_1442) .cse6 (+ (select (store (store (store .cse1 .cse5 v_ArrVal_1437) .cse2 .cse3) .cse4 v_ArrVal_1441) .cse6) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse6) 4)))) (< (select .cse8 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|)))) (< .cse11 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| Int)) (or (< .cse11 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1430 (Array Int Int)) (v_ArrVal_1428 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse16 (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse17 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse17 .cse5 v_ArrVal_1428) .cse6 (+ (select .cse17 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1430) |c_~#queue~0.base|))) (or (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1431 Int) (v_ArrVal_1442 Int) (v_ArrVal_1441 Int) (v_ArrVal_1434 Int) (v_ArrVal_1437 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse12 (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse15 (store .cse16 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1431))) (store (store .cse15 .cse5 v_ArrVal_1434) .cse6 (+ (select .cse15 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1436) |c_~#queue~0.base|))) (let ((.cse13 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse14 (+ (* (select .cse12 .cse6) 4) |c_~#queue~0.offset|))) (store (store (store (store .cse12 .cse2 .cse13) .cse14 v_ArrVal_1441) .cse5 v_ArrVal_1442) .cse6 (+ (select (store (store (store .cse12 .cse5 v_ArrVal_1437) .cse2 .cse13) .cse14 v_ArrVal_1441) .cse6) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse6) 4)) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse16 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|)))))))))) is different from false [2024-11-21 00:39:28,130 INFO L349 Elim1Store]: treesize reduction 306, result has 39.5 percent of original size [2024-11-21 00:39:28,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 1169 treesize of output 563 [2024-11-21 00:39:28,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:39:28,226 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 490 treesize of output 490 [2024-11-21 00:39:28,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-21 00:39:28,273 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 13 treesize of output 9 [2024-11-21 00:39:28,347 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 9 [2024-11-21 00:39:28,605 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 9 [2024-11-21 00:39:28,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:39:28,689 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 84 treesize of output 86 [2024-11-21 00:39:29,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:39:29,094 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 239 treesize of output 213 [2024-11-21 00:39:29,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:39:29,405 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:39:29,604 INFO L349 Elim1Store]: treesize reduction 292, result has 22.1 percent of original size [2024-11-21 00:39:29,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 1152 treesize of output 429 [2024-11-21 00:39:29,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:39:29,626 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:39:29,632 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 138 [2024-11-21 00:39:29,644 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:39:29,645 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:39:29,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:39:29,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 113 [2024-11-21 00:39:29,698 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:39:29,730 INFO L349 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2024-11-21 00:39:29,730 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 127 treesize of output 103 [2024-11-21 00:39:30,016 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 25 not checked. [2024-11-21 00:39:30,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228412826] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 00:39:30,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 00:39:30,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22, 31] total 79 [2024-11-21 00:39:30,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340397025] [2024-11-21 00:39:30,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 00:39:30,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2024-11-21 00:39:30,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:39:30,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2024-11-21 00:39:30,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=3674, Unknown=136, NotChecked=2100, Total=6320 [2024-11-21 00:39:30,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:39:30,021 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:39:30,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 3.95) internal successors, (316), 79 states have internal predecessors, (316), 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-21 00:39:30,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:39:30,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:39:30,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:39:30,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:39:30,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:39:30,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:39:30,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:39:30,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:39:30,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:39:30,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-21 00:39:30,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:39:30,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:39:30,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:39:30,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:39:30,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:39:30,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:39:30,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-21 00:39:30,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-21 00:39:30,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:39:30,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-11-21 00:39:30,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-21 00:39:30,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:39:56,353 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-21 00:40:07,088 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-21 00:40:09,111 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-21 00:40:11,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:40:13,327 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-21 00:40:16,220 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-21 00:40:20,790 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-21 00:40:33,174 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-21 00:40:38,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:40:41,290 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-21 00:40:44,171 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-21 00:40:54,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:40:54,400 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (* (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 80) 1)) |c_~#queue~0.base|) .cse8) 4)) (.cse0 (* (select (select |c_#memory_int| |c_~#queue~0.base|) .cse8) 4)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 80)) (.cse2 (select |c_#length| |c_~#queue~0.base|))) (and (<= 0 (+ .cse0 |c_~#queue~0.offset|)) (<= (+ |c_~#queue~0.offset| 4 .cse1) .cse2) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1442 Int) (v_ArrVal_1441 Int) (v_ArrVal_1437 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1436) |c_~#queue~0.base|))) (let ((.cse5 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse6 (+ (* (select .cse3 .cse8) 4) |c_~#queue~0.offset|))) (store (store (store (store .cse3 .cse4 .cse5) .cse6 v_ArrVal_1441) .cse7 v_ArrVal_1442) .cse8 (+ (select (store (store (store .cse3 .cse7 v_ArrVal_1437) .cse4 .cse5) .cse6 v_ArrVal_1441) .cse8) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse8) 4)))) (<= 0 (+ |c_~#queue~0.offset| .cse1)) (forall ((v_ArrVal_1445 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse8) 4) |c_~#queue~0.offset| 4) .cse2)) (forall ((v_ArrVal_1445 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse8) 4) |c_~#queue~0.offset|))) (<= (+ .cse0 |c_~#queue~0.offset| 4) .cse2) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1442 Int) (v_ArrVal_1441 Int) (v_ArrVal_1437 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse9 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1436) |c_~#queue~0.base|))) (let ((.cse10 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse11 (+ (* (select .cse9 .cse8) 4) |c_~#queue~0.offset|))) (store (store (store (store .cse9 .cse4 .cse10) .cse11 v_ArrVal_1441) .cse7 v_ArrVal_1442) .cse8 (+ (select (store (store (store .cse9 .cse7 v_ArrVal_1437) .cse4 .cse10) .cse11 v_ArrVal_1441) .cse8) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1445) |c_~#queue~0.base|) .cse8) 4) 4) .cse2))))) is different from false [2024-11-21 00:41:05,497 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-21 00:41:16,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:16,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:41:16,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:16,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:16,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:16,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:16,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:41:16,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:41:16,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:41:16,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-21 00:41:16,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:41:16,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:16,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:16,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:16,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:41:16,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:41:16,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-21 00:41:16,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-21 00:41:16,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:41:16,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-21 00:41:16,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-21 00:41:16,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-21 00:41:16,094 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-21 00:41:16,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:41:16,277 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-21 00:41:16,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:16,277 INFO L85 PathProgramCache]: Analyzing trace with hash -2051968635, now seen corresponding path program 2 times [2024-11-21 00:41:16,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:16,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801733832] [2024-11-21 00:41:16,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:16,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:16,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:19,923 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 51 proven. 74 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-21 00:41:19,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:19,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801733832] [2024-11-21 00:41:19,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801733832] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:41:19,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130547155] [2024-11-21 00:41:19,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 00:41:19,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:41:19,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:41:19,925 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:41:19,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-21 00:41:20,427 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 00:41:20,427 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 00:41:20,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 1227 conjuncts, 141 conjuncts are in the unsatisfiable core [2024-11-21 00:41:20,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:41:20,586 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-21 00:41:20,691 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-21 00:41:21,226 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 30 treesize of output 21 [2024-11-21 00:41:21,302 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 30 treesize of output 14 [2024-11-21 00:41:21,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-21 00:41:21,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:41:21,779 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 16 treesize of output 11 [2024-11-21 00:41:22,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:41:22,235 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 11 [2024-11-21 00:41:22,326 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-21 00:41:23,956 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 15 treesize of output 1 [2024-11-21 00:41:23,990 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-21 00:41:24,328 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 15 treesize of output 1 [2024-11-21 00:41:24,385 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-21 00:41:25,052 INFO L349 Elim1Store]: treesize reduction 36, result has 39.0 percent of original size [2024-11-21 00:41:25,052 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 44 [2024-11-21 00:41:25,257 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 31 treesize of output 22 [2024-11-21 00:41:25,840 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 33 treesize of output 24 [2024-11-21 00:41:26,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:41:26,026 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 24 treesize of output 17 [2024-11-21 00:41:26,520 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 31 treesize of output 22 [2024-11-21 00:41:26,646 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 92 proven. 51 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-21 00:41:26,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 00:41:27,097 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1691 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1691) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20))) is different from false [2024-11-21 00:41:30,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:41:30,853 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 212 treesize of output 140 [2024-11-21 00:41:30,860 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 150 treesize of output 142 [2024-11-21 00:41:30,868 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 64 treesize of output 48 [2024-11-21 00:41:30,876 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 32 treesize of output 20 [2024-11-21 00:41:30,883 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 26 treesize of output 22 [2024-11-21 00:42:24,955 INFO L349 Elim1Store]: treesize reduction 115, result has 46.5 percent of original size [2024-11-21 00:42:24,955 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 4 case distinctions, treesize of input 130 treesize of output 181 [2024-11-21 00:42:24,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:42:25,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:42:25,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 95 treesize of output 101 [2024-11-21 00:42:25,040 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-21 00:42:29,507 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 49 proven. 96 refuted. 4 times theorem prover too weak. 44 trivial. 2 not checked. [2024-11-21 00:42:29,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130547155] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 00:42:29,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 00:42:29,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 26, 28] total 70 [2024-11-21 00:42:29,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423774051] [2024-11-21 00:42:29,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 00:42:29,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-11-21 00:42:29,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:42:29,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-11-21 00:42:29,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=795, Invalid=3954, Unknown=85, NotChecked=136, Total=4970 [2024-11-21 00:42:29,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:42:29,512 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:42:29,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 5.352112676056338) internal successors, (380), 70 states have internal predecessors, (380), 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-21 00:42:29,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:42:29,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:42:29,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:42:29,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:42:29,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:42:29,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:42:29,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:42:29,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:42:29,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:42:29,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-21 00:42:29,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:42:29,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:42:29,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:42:29,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:42:29,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:42:29,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:42:29,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-21 00:42:29,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-21 00:42:29,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:42:29,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-11-21 00:42:29,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-11-21 00:42:29,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-11-21 00:42:29,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:42:49,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:42:49,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:42:49,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:42:49,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:42:49,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:42:49,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:42:49,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:42:49,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:42:49,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:42:49,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-21 00:42:49,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:42:49,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:42:49,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:42:49,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:42:49,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:42:49,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:42:49,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-21 00:42:49,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-21 00:42:49,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:42:49,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-21 00:42:49,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-21 00:42:49,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-21 00:42:49,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-21 00:42:49,668 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-21 00:42:49,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:42:49,846 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-21 00:42:49,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:42:49,846 INFO L85 PathProgramCache]: Analyzing trace with hash 976445271, now seen corresponding path program 3 times [2024-11-21 00:42:49,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:42:49,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944296946] [2024-11-21 00:42:49,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:42:49,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:42:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:42:59,731 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 104 proven. 68 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-21 00:42:59,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:42:59,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944296946] [2024-11-21 00:42:59,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944296946] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:42:59,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875175082] [2024-11-21 00:42:59,731 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-21 00:42:59,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:42:59,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:42:59,733 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:42:59,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-21 00:43:02,788 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-21 00:43:02,788 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 00:43:02,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 1234 conjuncts, 109 conjuncts are in the unsatisfiable core [2024-11-21 00:43:02,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:43:03,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:43:03,009 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 16 treesize of output 11 [2024-11-21 00:43:03,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:43:03,053 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 16 treesize of output 11 [2024-11-21 00:43:03,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:43:03,101 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 16 treesize of output 11 [2024-11-21 00:43:03,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:43:03,693 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 16 treesize of output 11 [2024-11-21 00:43:03,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:43:03,778 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 16 treesize of output 11 [2024-11-21 00:43:03,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:43:03,956 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 16 treesize of output 11 [2024-11-21 00:43:04,044 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-21 00:43:04,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:43:04,746 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 16 treesize of output 11 [2024-11-21 00:43:04,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:43:04,838 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 16 treesize of output 11 [2024-11-21 00:43:05,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:43:05,025 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 16 treesize of output 11 [2024-11-21 00:43:05,084 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-21 00:43:06,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:43:06,937 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 16 treesize of output 11 [2024-11-21 00:43:07,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:43:07,143 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 16 treesize of output 11 [2024-11-21 00:43:07,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:43:07,748 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 16 treesize of output 11 [2024-11-21 00:43:07,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:43:07,867 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 16 treesize of output 11 [2024-11-21 00:43:08,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:43:08,042 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 16 treesize of output 11 [2024-11-21 00:43:08,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:43:08,129 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 31 treesize of output 11 [2024-11-21 00:43:09,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:43:09,229 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 16 treesize of output 11 [2024-11-21 00:43:09,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:43:09,418 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 16 treesize of output 11 [2024-11-21 00:43:10,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:43:10,209 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 16 treesize of output 11 [2024-11-21 00:43:10,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:43:10,351 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 16 treesize of output 11 [2024-11-21 00:43:10,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:43:10,566 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 16 treesize of output 11 [2024-11-21 00:43:10,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:43:10,633 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 31 treesize of output 11 [2024-11-21 00:43:12,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:43:12,221 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2024-11-21 00:43:12,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 37 [2024-11-21 00:43:13,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:43:13,243 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 23 treesize of output 16 [2024-11-21 00:43:14,068 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 112 proven. 77 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-21 00:43:14,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 00:43:14,727 WARN L851 $PredicateComparison]: unable to prove that (and (<= 1 |c_t2Thread1of1ForFork1_dequeue_~x~0#1|) (forall ((v_ArrVal_1942 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_1942) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|)) 0))) is different from false [2024-11-21 00:43:16,489 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1938 Int) (v_ArrVal_1942 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_1938)))) (or (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| |c_~#queue~0.base|) (= (select (select (store .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| v_ArrVal_1942) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) 0) (not (= (select (select .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100|) (+ |c_~#queue~0.offset| 80)) 20))))) is different from false [2024-11-21 00:43:16,560 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1938 Int) (v_ArrVal_1942 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| Int) (v_ArrVal_1937 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| v_ArrVal_1937))) (store .cse1 |c_~#stored_elements~0.base| (store (select .cse1 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_1938))))) (or (= (select (select (store .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| v_ArrVal_1942) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) 0) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| |c_~#queue~0.base|) (not (= (select (select .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100|) (+ |c_~#queue~0.offset| 80)) 20))))) is different from false [2024-11-21 00:43:16,844 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1938 Int) (v_ArrVal_1942 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| Int) (v_ArrVal_1937 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937))) (store .cse1 |c_~#stored_elements~0.base| (store (select .cse1 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_1938))))) (or (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| |c_~#queue~0.base|) (not (= (select (select .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100|) (+ |c_~#queue~0.offset| 80)) 20)) (= (select (select (store .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| v_ArrVal_1942) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) 0) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| |c_~#queue~0.base|)))) is different from false [2024-11-21 00:43:17,184 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1938 Int) (v_ArrVal_1942 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| Int) (v_ArrVal_1937 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937))) (store .cse1 |c_~#stored_elements~0.base| (store (select .cse1 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_1938))))) (or (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| |c_~#queue~0.base|) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| |c_~#queue~0.base|) (= 0 (select (select (store .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| v_ArrVal_1942) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4))) (not (= (select (select .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100|) (+ |c_~#queue~0.offset| 80)) 20))))) is different from false [2024-11-21 00:43:17,623 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1938 Int) (v_ArrVal_1942 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| Int) (v_ArrVal_1937 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store (store |c_#memory_int| |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937))) (store .cse1 |c_~#stored_elements~0.base| (store (select .cse1 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_1938))))) (or (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| |c_~#queue~0.base|) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| |c_~#queue~0.base|) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| |c_~#queue~0.base|) (not (= 20 (select (select .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100|) (+ |c_~#queue~0.offset| 80)))) (= (select (select (store .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| v_ArrVal_1942) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) 0)))) is different from false [2024-11-21 00:43:17,878 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1938 Int) (v_ArrVal_1942 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| Int) (v_ArrVal_1937 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store (store |c_#memory_int| |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937))) (store .cse1 |c_~#stored_elements~0.base| (store (select .cse1 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_1938))))) (or (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| |c_~#queue~0.base|) (= (select (select (store .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| v_ArrVal_1942) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 8)) 0) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| |c_~#queue~0.base|) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| |c_~#queue~0.base|) (not (= 20 (select (select .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100|) (+ |c_~#queue~0.offset| 80))))))) is different from false [2024-11-21 00:43:19,990 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_79| Int)) (or (< |v_t1Thread1of1ForFork0_~i~0#1_79| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1938 Int) (v_ArrVal_1942 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| Int) (v_ArrVal_1937 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store (store |c_#memory_int| |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937))) (store .cse1 |c_~#stored_elements~0.base| (store (select .cse1 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_79| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1938))))) (or (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| |c_~#queue~0.base|) (not (= (select (select .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100|) (+ |c_~#queue~0.offset| 80)) 20)) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| |c_~#queue~0.base|) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| |c_~#queue~0.base|) (= (select (select (store .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| v_ArrVal_1942) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 8)) 0)))))) is different from false [2024-11-21 00:43:20,094 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1934 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_79| Int) (v_ArrVal_1938 Int) (v_ArrVal_1942 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| Int) (v_ArrVal_1931 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| Int) (v_ArrVal_1937 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base| (store (select (store (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_1931)) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_79| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1938)))) (or (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| |c_~#queue~0.base|) (not (= (select (select .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100|) (+ |c_~#queue~0.offset| 80)) 20)) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| |c_~#queue~0.base|) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| |c_~#queue~0.base|) (< |v_t1Thread1of1ForFork0_~i~0#1_79| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (= (select (select (store .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| v_ArrVal_1942) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 8)) 0)))) is different from false [2024-11-21 00:43:20,203 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1934 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_79| Int) (v_ArrVal_1938 Int) (v_ArrVal_1942 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| Int) (v_ArrVal_1931 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| Int) (v_ArrVal_1937 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| v_ArrVal_1930))) (store (store (store .cse1 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base| (store (select (store (store (store .cse1 |c_~#stored_elements~0.base| (store (select .cse1 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_1931)) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_79| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1938))))) (or (= (select (select (store .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| v_ArrVal_1942) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 8)) 0) (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| |c_~#queue~0.base|) (not (= 20 (select (select .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100|) (+ |c_~#queue~0.offset| 80)))) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| |c_~#queue~0.base|) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| |c_~#queue~0.base|) (< |v_t1Thread1of1ForFork0_~i~0#1_79| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-11-21 00:43:20,645 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1934 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_79| Int) (v_ArrVal_1938 Int) (v_ArrVal_1942 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| Int) (v_ArrVal_1931 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| Int) (v_ArrVal_1937 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_1930))) (store (store (store .cse1 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base| (store (select (store (store (store .cse1 |c_~#stored_elements~0.base| (store (select .cse1 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_1931)) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_79| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1938))))) (or (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| |c_~#queue~0.base|) (not (= (select (select .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100|) (+ |c_~#queue~0.offset| 80)) 20)) (= (select (select (store .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| v_ArrVal_1942) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 8)) 0) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| |c_~#queue~0.base|) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| |c_~#queue~0.base|) (< |v_t1Thread1of1ForFork0_~i~0#1_79| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-11-21 00:43:21,207 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1934 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_79| Int) (v_ArrVal_1938 Int) (v_ArrVal_1942 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| Int) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1931 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| Int) (v_ArrVal_1937 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_1927) |c_~#queue~0.base| v_ArrVal_1930))) (store (store (store .cse1 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base| (store (select (store (store (store .cse1 |c_~#stored_elements~0.base| (store (select .cse1 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_1931)) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_79| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1938))))) (or (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| |c_~#queue~0.base|) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| |c_~#queue~0.base|) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| |c_~#queue~0.base|) (< |v_t1Thread1of1ForFork0_~i~0#1_79| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (= (select (select (store .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| v_ArrVal_1942) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 8)) 0) (not (= (select (select .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100|) (+ |c_~#queue~0.offset| 80)) 20))))) is different from false [2024-11-21 00:43:21,799 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1934 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_79| Int) (v_ArrVal_1938 Int) (v_ArrVal_1942 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| Int) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1931 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| Int) (v_ArrVal_1937 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| Int)) (let ((.cse0 (let ((.cse1 (store (store |c_#memory_int| |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| v_ArrVal_1927) |c_~#queue~0.base| v_ArrVal_1930))) (store (store (store .cse1 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base| (store (select (store (store (store .cse1 |c_~#stored_elements~0.base| (store (select .cse1 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_1931)) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_79| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1938))))) (or (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| |c_~#queue~0.base|) (not (= 20 (select (select .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100|) (+ |c_~#queue~0.offset| 80)))) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| |c_~#queue~0.base|) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| |c_~#queue~0.base|) (= (select (select (store .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| v_ArrVal_1942) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 8)) 0) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| |c_~#queue~0.base|) (< |v_t1Thread1of1ForFork0_~i~0#1_79| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-11-21 00:43:22,133 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1934 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_79| Int) (v_ArrVal_1938 Int) (v_ArrVal_1942 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| Int) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1931 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| Int) (v_ArrVal_1937 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| Int)) (let ((.cse0 (let ((.cse1 (store (store |c_#memory_int| |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| v_ArrVal_1927) |c_~#queue~0.base| v_ArrVal_1930))) (store (store (store .cse1 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base| (store (select (store (store (store .cse1 |c_~#stored_elements~0.base| (store (select .cse1 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_1931)) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_79| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1938))))) (or (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| |c_~#queue~0.base|) (not (= 20 (select (select .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100|) (+ |c_~#queue~0.offset| 80)))) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| |c_~#queue~0.base|) (= (select (select (store .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| v_ArrVal_1942) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 8)) 0) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| |c_~#queue~0.base|) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| |c_~#queue~0.base|) (< |v_t1Thread1of1ForFork0_~i~0#1_79| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-11-21 00:43:22,571 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_80| Int)) (or (forall ((v_ArrVal_1934 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_79| Int) (v_ArrVal_1938 Int) (v_ArrVal_1942 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| Int) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1931 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| Int) (v_ArrVal_1937 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| Int)) (let ((.cse0 (let ((.cse1 (store (store |c_#memory_int| |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| v_ArrVal_1927) |c_~#queue~0.base| v_ArrVal_1930))) (store (store (store .cse1 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base| (store (select (store (store (store .cse1 |c_~#stored_elements~0.base| (store (select .cse1 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_80| 4) 4) v_ArrVal_1931)) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_79| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1938))))) (or (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| |c_~#queue~0.base|) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| |c_~#queue~0.base|) (= (select (select (store .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| v_ArrVal_1942) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 8)) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_79| (+ |v_t1Thread1of1ForFork0_~i~0#1_80| 1)) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| |c_~#queue~0.base|) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| |c_~#queue~0.base|) (not (= (select (select .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100|) (+ |c_~#queue~0.offset| 80)) 20))))) (< |v_t1Thread1of1ForFork0_~i~0#1_80| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)))) is different from false [2024-11-21 00:43:23,223 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1938 Int) (v_ArrVal_1942 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_80| Int) (|v_t1Thread1of1ForFork0_~i~0#1_79| Int) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| Int) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1931 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| Int) (v_ArrVal_1937 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| Int)) (let ((.cse0 (let ((.cse1 (store (store |c_#memory_int| |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| v_ArrVal_1927) |c_~#queue~0.base| v_ArrVal_1930))) (store (store (store .cse1 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base| (store (select (store (store (store .cse1 |c_~#stored_elements~0.base| (store (select .cse1 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_80| 4) 4) v_ArrVal_1931)) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_79| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1938))))) (or (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| |c_~#queue~0.base|) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| |c_~#queue~0.base|) (= (select (select (store .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| v_ArrVal_1942) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 8)) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_79| (+ |v_t1Thread1of1ForFork0_~i~0#1_80| 1)) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| |c_~#queue~0.base|) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| |c_~#queue~0.base|) (< |v_t1Thread1of1ForFork0_~i~0#1_80| (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (not (= (select (select .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100|) (+ |c_~#queue~0.offset| 80)) 20))))) is different from false [2024-11-21 00:43:23,813 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1938 Int) (v_ArrVal_1942 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_80| Int) (|v_t1Thread1of1ForFork0_~i~0#1_79| Int) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| Int) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1931 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| Int) (v_ArrVal_1937 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| Int)) (let ((.cse0 (let ((.cse1 (store (store |c_#memory_int| |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| v_ArrVal_1927) |c_~#queue~0.base| v_ArrVal_1930))) (store (store (store .cse1 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base| (store (select (store (store (store .cse1 |c_~#stored_elements~0.base| (store (select .cse1 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_80| 4) 4) v_ArrVal_1931)) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_79| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1938))))) (or (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| |c_~#queue~0.base|) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| |c_~#queue~0.base|) (= (select (select (store .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| v_ArrVal_1942) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 8)) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_79| (+ |v_t1Thread1of1ForFork0_~i~0#1_80| 1)) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| |c_~#queue~0.base|) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| |c_~#queue~0.base|) (not (= (select (select .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100|) (+ |c_~#queue~0.offset| 80)) 20)) (< |v_t1Thread1of1ForFork0_~i~0#1_80| (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))))) is different from false [2024-11-21 00:43:24,023 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1925 Int) (v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1938 Int) (v_ArrVal_1942 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_80| Int) (|v_t1Thread1of1ForFork0_~i~0#1_79| Int) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| Int) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1931 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| Int) (v_ArrVal_1937 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| Int)) (let ((.cse0 (let ((.cse1 (store (store |c_#memory_int| |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| v_ArrVal_1927) |c_~#queue~0.base| v_ArrVal_1930))) (store (store (store .cse1 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base| (store (select (store (store (store .cse1 |c_~#stored_elements~0.base| (store (select (store (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_1925)) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| v_ArrVal_1927) |c_~#queue~0.base| v_ArrVal_1930) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_80| 4) 4) v_ArrVal_1931)) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_79| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1938))))) (or (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| |c_~#queue~0.base|) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| |c_~#queue~0.base|) (= (select (select (store .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| v_ArrVal_1942) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 8)) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_79| (+ |v_t1Thread1of1ForFork0_~i~0#1_80| 1)) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| |c_~#queue~0.base|) (not (= (select (select .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100|) (+ |c_~#queue~0.offset| 80)) 20)) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| |c_~#queue~0.base|) (< |v_t1Thread1of1ForFork0_~i~0#1_80| (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))))) is different from false [2024-11-21 00:43:24,223 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1923 (Array Int Int)) (v_ArrVal_1925 Int) (v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1938 Int) (v_ArrVal_1942 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_80| Int) (|v_t1Thread1of1ForFork0_~i~0#1_79| Int) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| Int) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1931 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| Int) (v_ArrVal_1937 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| Int)) (let ((.cse0 (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| v_ArrVal_1923))) (let ((.cse1 (store (store .cse2 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| v_ArrVal_1927) |c_~#queue~0.base| v_ArrVal_1930))) (store (store (store .cse1 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base| (store (select (store (store (store .cse1 |c_~#stored_elements~0.base| (store (select (store (store (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_1925)) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| v_ArrVal_1927) |c_~#queue~0.base| v_ArrVal_1930) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_80| 4) 4) v_ArrVal_1931)) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_79| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1938)))))) (or (= (select (select (store .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| v_ArrVal_1942) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 8)) 0) (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| |c_~#queue~0.base|) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| |c_~#queue~0.base|) (< |v_t1Thread1of1ForFork0_~i~0#1_79| (+ |v_t1Thread1of1ForFork0_~i~0#1_80| 1)) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| |c_~#queue~0.base|) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| |c_~#queue~0.base|) (< |v_t1Thread1of1ForFork0_~i~0#1_80| (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)) (not (= 20 (select (select .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100|) (+ |c_~#queue~0.offset| 80))))))) is different from false [2024-11-21 00:43:25,055 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1923 (Array Int Int)) (v_ArrVal_1925 Int) (v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1938 Int) (v_ArrVal_1942 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_80| Int) (|v_t1Thread1of1ForFork0_~i~0#1_79| Int) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_182| Int) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| Int) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1931 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| Int) (v_ArrVal_1937 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| Int)) (let ((.cse0 (let ((.cse2 (store |c_#memory_int| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_182| v_ArrVal_1923))) (let ((.cse1 (store (store .cse2 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| v_ArrVal_1927) |c_~#queue~0.base| v_ArrVal_1930))) (store (store (store .cse1 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base| (store (select (store (store (store .cse1 |c_~#stored_elements~0.base| (store (select (store (store (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_1925)) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| v_ArrVal_1927) |c_~#queue~0.base| v_ArrVal_1930) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_80| 4) 4) v_ArrVal_1931)) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_79| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1938)))))) (or (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_182| |c_~#queue~0.base|) (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| |c_~#queue~0.base|) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| |c_~#queue~0.base|) (< |v_t1Thread1of1ForFork0_~i~0#1_79| (+ |v_t1Thread1of1ForFork0_~i~0#1_80| 1)) (= (select (select (store .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| v_ArrVal_1942) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 8)) 0) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| |c_~#queue~0.base|) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| |c_~#queue~0.base|) (< |v_t1Thread1of1ForFork0_~i~0#1_80| (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)) (not (= 20 (select (select .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100|) (+ |c_~#queue~0.offset| 80))))))) is different from false [2024-11-21 00:43:25,532 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1923 (Array Int Int)) (v_ArrVal_1925 Int) (v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1938 Int) (v_ArrVal_1942 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_80| Int) (|v_t1Thread1of1ForFork0_~i~0#1_79| Int) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_182| Int) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| Int) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1931 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| Int) (v_ArrVal_1937 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| Int)) (let ((.cse0 (let ((.cse2 (store |c_#memory_int| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_182| v_ArrVal_1923))) (let ((.cse1 (store (store .cse2 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| v_ArrVal_1927) |c_~#queue~0.base| v_ArrVal_1930))) (store (store (store .cse1 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base| (store (select (store (store (store .cse1 |c_~#stored_elements~0.base| (store (select (store (store (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4) v_ArrVal_1925)) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| v_ArrVal_1927) |c_~#queue~0.base| v_ArrVal_1930) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_80| 4) 4) v_ArrVal_1931)) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_79| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1938)))))) (or (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_182| |c_~#queue~0.base|) (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| |c_~#queue~0.base|) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| |c_~#queue~0.base|) (< |v_t1Thread1of1ForFork0_~i~0#1_79| (+ |v_t1Thread1of1ForFork0_~i~0#1_80| 1)) (not (= 20 (select (select .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100|) (+ |c_~#queue~0.offset| 80)))) (< |v_t1Thread1of1ForFork0_~i~0#1_80| 3) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| |c_~#queue~0.base|) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| |c_~#queue~0.base|) (= (select (select (store .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| v_ArrVal_1942) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 8)) 0)))) is different from false [2024-11-21 00:43:26,202 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1923 (Array Int Int)) (v_ArrVal_1925 Int) (v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1938 Int) (v_ArrVal_1942 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_80| Int) (|v_t1Thread1of1ForFork0_~i~0#1_79| Int) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_182| Int) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| Int) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1931 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| Int) (v_ArrVal_1937 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| Int)) (let ((.cse0 (let ((.cse2 (store |c_#memory_int| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_182| v_ArrVal_1923))) (let ((.cse1 (store (store .cse2 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| v_ArrVal_1927) |c_~#queue~0.base| v_ArrVal_1930))) (store (store (store .cse1 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base| (store (select (store (store (store .cse1 |c_~#stored_elements~0.base| (store (select (store (store (store .cse2 |c_~#stored_elements~0.base| (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|)) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_182| v_ArrVal_1923) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4) v_ArrVal_1925)) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| v_ArrVal_1927) |c_~#queue~0.base| v_ArrVal_1930) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_80| 4) 4) v_ArrVal_1931)) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_79| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1938)))))) (or (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_182| |c_~#queue~0.base|) (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| |c_~#queue~0.base|) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| |c_~#queue~0.base|) (not (= 20 (select (select .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100|) (+ |c_~#queue~0.offset| 80)))) (< |v_t1Thread1of1ForFork0_~i~0#1_79| (+ |v_t1Thread1of1ForFork0_~i~0#1_80| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_80| 3) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| |c_~#queue~0.base|) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| |c_~#queue~0.base|) (= (select (select (store .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| v_ArrVal_1942) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 8)) 0)))) is different from false [2024-11-21 00:43:26,642 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1923 (Array Int Int)) (v_ArrVal_1925 Int) (v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1938 Int) (v_ArrVal_1942 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_80| Int) (|v_t1Thread1of1ForFork0_~i~0#1_79| Int) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_182| Int) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| Int) (v_ArrVal_1919 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| Int) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1931 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| Int) (v_ArrVal_1937 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| Int)) (let ((.cse0 (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| v_ArrVal_1919))) (let ((.cse2 (store .cse3 |v_t1Thread1of1ForFork0_enqueue_~q#1.base_182| v_ArrVal_1923))) (let ((.cse1 (store (store .cse2 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| v_ArrVal_1927) |c_~#queue~0.base| v_ArrVal_1930))) (store (store (store .cse1 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base| (store (select (store (store (store .cse1 |c_~#stored_elements~0.base| (store (select (store (store (store .cse2 |c_~#stored_elements~0.base| (store (select (store (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|)) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_182| v_ArrVal_1923) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4) v_ArrVal_1925)) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| v_ArrVal_1927) |c_~#queue~0.base| v_ArrVal_1930) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_80| 4) 4) v_ArrVal_1931)) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_79| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1938))))))) (or (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_182| |c_~#queue~0.base|) (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| |c_~#queue~0.base|) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| |c_~#queue~0.base|) (< |v_t1Thread1of1ForFork0_~i~0#1_79| (+ |v_t1Thread1of1ForFork0_~i~0#1_80| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_80| 3) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| |c_~#queue~0.base|) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| |c_~#queue~0.base|) (not (= (select (select .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100|) (+ |c_~#queue~0.offset| 80)) 20)) (= (select (select (store .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| v_ArrVal_1942) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 8)) 0)))) is different from false [2024-11-21 00:43:27,619 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1923 (Array Int Int)) (v_ArrVal_1925 Int) (v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1938 Int) (v_ArrVal_1942 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_80| Int) (|v_t1Thread1of1ForFork0_~i~0#1_79| Int) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_182| Int) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| Int) (v_ArrVal_1919 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| Int) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1931 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| Int) (v_ArrVal_1937 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| Int)) (let ((.cse0 (let ((.cse2 (store |c_#memory_int| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_182| v_ArrVal_1923))) (let ((.cse1 (store (store .cse2 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| v_ArrVal_1927) |c_~#queue~0.base| v_ArrVal_1930))) (store (store (store .cse1 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base| (store (select (store (store (store .cse1 |c_~#stored_elements~0.base| (store (select (store (store (store .cse2 |c_~#stored_elements~0.base| (store (select (store (let ((.cse3 (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_1919))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_182| v_ArrVal_1923) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4) v_ArrVal_1925)) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| v_ArrVal_1927) |c_~#queue~0.base| v_ArrVal_1930) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_80| 4) 4) v_ArrVal_1931)) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_79| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1938)))))) (or (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_182| |c_~#queue~0.base|) (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| |c_~#queue~0.base|) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| |c_~#queue~0.base|) (< |v_t1Thread1of1ForFork0_~i~0#1_79| (+ |v_t1Thread1of1ForFork0_~i~0#1_80| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_80| 3) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| |c_~#queue~0.base|) (not (= (select (select .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100|) (+ |c_~#queue~0.offset| 80)) 20)) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| |c_~#queue~0.base|) (= (select (select (store .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| v_ArrVal_1942) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 8)) 0)))) is different from false [2024-11-21 00:43:28,599 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1923 (Array Int Int)) (v_ArrVal_1925 Int) (v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1938 Int) (v_ArrVal_1942 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_80| Int) (|v_t1Thread1of1ForFork0_~i~0#1_79| Int) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_182| Int) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| Int) (v_ArrVal_1919 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| Int) (v_ArrVal_1916 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1931 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| Int) (v_ArrVal_1937 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| Int)) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| v_ArrVal_1916))) (let ((.cse2 (store .cse4 |v_t1Thread1of1ForFork0_enqueue_~q#1.base_182| v_ArrVal_1923))) (let ((.cse1 (store (store .cse2 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| v_ArrVal_1927) |c_~#queue~0.base| v_ArrVal_1930))) (store (store (store .cse1 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base| (store (select (store (store (store .cse1 |c_~#stored_elements~0.base| (store (select (store (store (store .cse2 |c_~#stored_elements~0.base| (store (select (store (let ((.cse3 (store .cse4 |c_~#queue~0.base| v_ArrVal_1919))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_182| v_ArrVal_1923) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4) v_ArrVal_1925)) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| v_ArrVal_1927) |c_~#queue~0.base| v_ArrVal_1930) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_80| 4) 4) v_ArrVal_1931)) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| v_ArrVal_1934) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| v_ArrVal_1937) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_79| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1938))))))) (or (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_182| |c_~#queue~0.base|) (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_178| |c_~#queue~0.base|) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_104| |c_~#queue~0.base|) (= (select (select (store .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| v_ArrVal_1942) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 8)) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_79| (+ |v_t1Thread1of1ForFork0_~i~0#1_80| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_80| 3) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100| |c_~#queue~0.base|) (< |v_t2Thread1of1ForFork1_dequeue_~q#1.base_102| |c_~#queue~0.base|) (not (= (select (select .cse0 |v_t2Thread1of1ForFork1_dequeue_~q#1.base_100|) (+ |c_~#queue~0.offset| 80)) 20))))) is different from false [2024-11-21 00:43:28,860 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 88 not checked. [2024-11-21 00:43:28,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875175082] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 00:43:28,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 00:43:28,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 35] total 92 [2024-11-21 00:43:28,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089426528] [2024-11-21 00:43:28,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 00:43:28,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2024-11-21 00:43:28,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:43:28,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2024-11-21 00:43:28,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=4241, Unknown=27, NotChecked=3900, Total=8556 [2024-11-21 00:43:28,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:43:28,868 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:43:28,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 93 states, 93 states have (on average 4.827956989247312) internal successors, (449), 92 states have internal predecessors, (449), 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-21 00:43:28,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:43:28,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:43:28,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:43:28,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:43:28,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:43:28,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:43:28,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:43:28,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:43:28,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:43:28,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-21 00:43:28,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:43:28,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:43:28,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:43:28,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:43:28,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:43:28,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:43:28,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-21 00:43:28,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-21 00:43:28,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:43:28,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-11-21 00:43:28,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-11-21 00:43:28,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-11-21 00:43:28,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-11-21 00:43:28,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:44:01,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:44:01,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:44:01,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:44:01,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:44:01,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:44:01,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:44:01,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:44:01,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:44:01,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:44:01,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-21 00:44:01,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:44:01,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:44:01,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:44:01,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:44:01,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:44:01,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:44:01,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-21 00:44:01,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-21 00:44:01,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:44:01,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-21 00:44:01,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-21 00:44:01,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-21 00:44:01,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-21 00:44:01,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-11-21 00:44:01,029 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-21 00:44:01,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:44:01,206 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-21 00:44:01,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:44:01,206 INFO L85 PathProgramCache]: Analyzing trace with hash -552630850, now seen corresponding path program 1 times [2024-11-21 00:44:01,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:44:01,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453910242] [2024-11-21 00:44:01,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:44:01,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:44:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:44:01,323 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-21 00:44:01,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:44:01,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453910242] [2024-11-21 00:44:01,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453910242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:44:01,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:44:01,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 00:44:01,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462153369] [2024-11-21 00:44:01,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:44:01,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:44:01,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:44:01,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:44:01,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:44:01,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:44:01,326 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:44:01,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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-21 00:44:01,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:44:01,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:44:01,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:44:01,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:44:01,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:44:01,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:44:01,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:44:01,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:44:01,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:44:01,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-21 00:44:01,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:44:01,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:44:01,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:44:01,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:44:01,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:44:01,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:44:01,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-21 00:44:01,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-21 00:44:01,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:44:01,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-11-21 00:44:01,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-11-21 00:44:01,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-11-21 00:44:01,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-11-21 00:44:01,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-11-21 00:44:01,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:44:25,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:44:25,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:44:25,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:44:25,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:44:25,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:44:25,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:44:25,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:44:25,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 00:44:25,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:44:25,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-21 00:44:25,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:44:25,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:44:25,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:44:25,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:44:25,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:44:25,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:44:25,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-21 00:44:25,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-21 00:44:25,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:44:25,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-21 00:44:25,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-21 00:44:25,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-21 00:44:25,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-21 00:44:25,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2024-11-21 00:44:25,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:44:25,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-21 00:44:25,542 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-21 00:44:25,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:44:25,542 INFO L85 PathProgramCache]: Analyzing trace with hash -891245758, now seen corresponding path program 1 times [2024-11-21 00:44:25,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:44:25,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840089303] [2024-11-21 00:44:25,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:44:25,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:44:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:44:34,174 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-21 00:44:34,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:44:34,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840089303] [2024-11-21 00:44:34,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840089303] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:44:34,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382220743] [2024-11-21 00:44:34,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:44:34,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:44:34,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:44:34,177 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:44:34,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f5e0c-4881-41a2-acd6-e150ca584ce2/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-21 00:44:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:44:34,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 1044 conjuncts, 151 conjuncts are in the unsatisfiable core [2024-11-21 00:44:34,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:44:34,830 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-21 00:44:35,038 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-21 00:44:35,909 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:44:35,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:44:35,970 INFO L349 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2024-11-21 00:44:35,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 28 [2024-11-21 00:44:36,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:44:36,098 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:44:36,099 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 38 treesize of output 16 [2024-11-21 00:44:36,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 3 [2024-11-21 00:44:36,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:44:36,981 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 18 treesize of output 13 [2024-11-21 00:44:37,699 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:44:37,728 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-11-21 00:44:37,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2024-11-21 00:44:37,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:44:37,834 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 29 treesize of output 13 [2024-11-21 00:44:38,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 15 [2024-11-21 00:44:38,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:44:38,461 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 18 treesize of output 13 [2024-11-21 00:44:39,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:44:39,506 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 29 treesize of output 13 [2024-11-21 00:44:39,668 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 29 treesize of output 13 [2024-11-21 00:44:40,500 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:44:40,532 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-11-21 00:44:40,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2024-11-21 00:44:40,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:44:40,623 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 29 treesize of output 13 [2024-11-21 00:44:41,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 15 [2024-11-21 00:44:41,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:44:41,463 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 18 treesize of output 13 [2024-11-21 00:44:42,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:44:42,057 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 29 treesize of output 13 [2024-11-21 00:44:42,220 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 29 treesize of output 13 [2024-11-21 00:44:42,920 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:44:42,957 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-21 00:44:42,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 42 [2024-11-21 00:44:43,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:44:43,268 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 42 treesize of output 20 [2024-11-21 00:44:43,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 22 [2024-11-21 00:44:43,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:44:43,946 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 31 treesize of output 24 [2024-11-21 00:44:44,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:44:44,692 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 42 treesize of output 20 [2024-11-21 00:44:44,850 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 42 treesize of output 20 [2024-11-21 00:44:45,268 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 32 treesize of output 14 [2024-11-21 00:44:45,451 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-21 00:44:45,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 00:44:55,701 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_2259 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2259) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2259 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2259) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2024-11-21 00:44:55,734 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_2259 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2259) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_2259 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2259) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2024-11-21 00:44:56,195 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2256 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_2256) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_2259) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2256 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_2256) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_2259) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2024-11-21 00:45:07,058 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse8 (select .cse6 .cse7))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| Int)) (or (forall ((v_ArrVal_2250 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| 1))))) (let ((.cse4 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2250) |c_~#queue~0.base|))) (let ((.cse5 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2256 Int) (v_ArrVal_2255 Int)) (<= (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 .cse5 v_ArrVal_2255))) (store (store .cse1 .cse2 v_ArrVal_2256) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2259) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< .cse5 0)))))) (< .cse8 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| Int)) (or (forall ((v_ArrVal_2250 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| 1))))) (let ((.cse11 (select (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_2250) |c_~#queue~0.base|))) (let ((.cse12 (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2256 Int) (v_ArrVal_2255 Int)) (<= 0 (+ (* (select (select (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse11 .cse12 v_ArrVal_2255))) (store (store .cse10 .cse2 v_ArrVal_2256) .cse3 (+ (select .cse10 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2259) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (< .cse12 0)))))) (< .cse8 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143|)))))) is different from false [2024-11-21 00:47:08,967 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#queue~0.offset| 80)) (.cse0 (select .cse6 .cse3))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| Int) (v_ArrVal_2243 Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166|) (forall ((v_ArrVal_2246 Int)) (let ((.cse8 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| 4) |c_~#queue~0.offset|))) (let ((.cse10 (select (store (store (store .cse6 .cse2 v_ArrVal_2243) .cse7 .cse8) .cse9 v_ArrVal_2246) .cse3))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| Int) (v_ArrVal_2248 Int)) (or (forall ((v_ArrVal_2250 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse6 .cse7 .cse8) .cse9 v_ArrVal_2246) .cse2 v_ArrVal_2248) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| 1))) |c_~#stored_elements~0.base| v_ArrVal_2250) |c_~#queue~0.base|))) (let ((.cse5 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2256 Int) (v_ArrVal_2255 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse1 (store .cse4 .cse5 v_ArrVal_2255))) (store (store .cse1 .cse2 v_ArrVal_2256) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2259) |c_~#queue~0.base|) .cse3) 4)))) (< .cse5 0))))) (< .cse10 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143|))) (= 20 .cse10))))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| Int) (v_ArrVal_2243 Int)) (or (forall ((v_ArrVal_2246 Int)) (let ((.cse14 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse15 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| 4) |c_~#queue~0.offset|))) (let ((.cse16 (select (store (store (store .cse6 .cse2 v_ArrVal_2243) .cse7 .cse14) .cse15 v_ArrVal_2246) .cse3))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| Int) (v_ArrVal_2248 Int)) (or (forall ((v_ArrVal_2250 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse6 .cse7 .cse14) .cse15 v_ArrVal_2246) .cse2 v_ArrVal_2248) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| 1))) |c_~#stored_elements~0.base| v_ArrVal_2250) |c_~#queue~0.base|))) (let ((.cse13 (+ (* (select .cse12 .cse3) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2256 Int) (v_ArrVal_2255 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse11 (store .cse12 .cse13 v_ArrVal_2255))) (store (store .cse11 .cse2 v_ArrVal_2256) .cse3 (+ (select .cse11 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2259) |c_~#queue~0.base|) .cse3) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (< .cse13 0))))) (< .cse16 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143|))) (= 20 .cse16))))) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166|)))))) is different from false [2024-11-21 00:47:12,678 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#queue~0.offset| 80)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| Int) (v_ArrVal_2243 Int) (v_ArrVal_2241 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2246 Int)) (let ((.cse8 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| 4) |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store (store .cse6 .cse3 v_ArrVal_2243) .cse7 .cse8) .cse9 v_ArrVal_2246) .cse4))) (or (= .cse0 20) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| Int) (v_ArrVal_2248 Int)) (or (forall ((v_ArrVal_2250 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse6 .cse7 .cse8) .cse9 v_ArrVal_2246) .cse3 v_ArrVal_2248) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| 1))) |c_~#stored_elements~0.base| v_ArrVal_2250) |c_~#queue~0.base|))) (let ((.cse1 (+ (* (select .cse5 .cse4) 4) |c_~#queue~0.offset|))) (or (< .cse1 0) (forall ((v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2256 Int) (v_ArrVal_2255 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse2 (store .cse5 .cse1 v_ArrVal_2255))) (store (store .cse2 .cse3 v_ArrVal_2256) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2259) |c_~#queue~0.base|) .cse4) 4)))))))) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143|))))))) (< (select .cse6 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166|)))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| Int) (v_ArrVal_2243 Int) (v_ArrVal_2241 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2246 Int)) (let ((.cse15 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse16 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| 4) |c_~#queue~0.offset|))) (let ((.cse10 (select (store (store (store .cse14 .cse3 v_ArrVal_2243) .cse7 .cse15) .cse16 v_ArrVal_2246) .cse4))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| Int) (v_ArrVal_2248 Int)) (or (< .cse10 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143|) (forall ((v_ArrVal_2250 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse14 .cse7 .cse15) .cse16 v_ArrVal_2246) .cse3 v_ArrVal_2248) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| 1))) |c_~#stored_elements~0.base| v_ArrVal_2250) |c_~#queue~0.base|))) (let ((.cse11 (+ (* (select .cse13 .cse4) 4) |c_~#queue~0.offset|))) (or (< .cse11 0) (forall ((v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2256 Int) (v_ArrVal_2255 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse12 (store .cse13 .cse11 v_ArrVal_2255))) (store (store .cse12 .cse3 v_ArrVal_2256) .cse4 (+ (select .cse12 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2259) |c_~#queue~0.base|) .cse4) 4) 4) (select |c_#length| |c_~#queue~0.base|))))))))) (= .cse10 20))))) (< (select .cse14 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166|)))))) is different from false [2024-11-21 00:47:13,052 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#queue~0.offset| 80)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| Int) (v_ArrVal_2243 Int) (v_ArrVal_2241 (Array Int Int))) (let ((.cse6 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2246 Int)) (let ((.cse8 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| 4) |c_~#queue~0.offset|))) (let ((.cse10 (select (store (store (store .cse6 .cse2 v_ArrVal_2243) .cse7 .cse8) .cse9 v_ArrVal_2246) .cse3))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| Int) (v_ArrVal_2248 Int)) (or (forall ((v_ArrVal_2250 (Array Int Int))) (let ((.cse4 (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse6 .cse7 .cse8) .cse9 v_ArrVal_2246) .cse2 v_ArrVal_2248) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| 1))) |c_~#stored_elements~0.base| v_ArrVal_2250) |c_~#queue~0.base|))) (let ((.cse5 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2256 Int) (v_ArrVal_2255 Int)) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 .cse5 v_ArrVal_2255))) (store (store .cse1 .cse2 v_ArrVal_2256) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2259) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (< .cse5 0))))) (< .cse10 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143|))) (= 20 .cse10))))) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166|)))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| Int) (v_ArrVal_2243 Int) (v_ArrVal_2241 (Array Int Int))) (let ((.cse14 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2246 Int)) (let ((.cse15 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse16 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| 4) |c_~#queue~0.offset|))) (let ((.cse17 (select (store (store (store .cse14 .cse2 v_ArrVal_2243) .cse7 .cse15) .cse16 v_ArrVal_2246) .cse3))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| Int) (v_ArrVal_2248 Int)) (or (forall ((v_ArrVal_2250 (Array Int Int))) (let ((.cse13 (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse14 .cse7 .cse15) .cse16 v_ArrVal_2246) .cse2 v_ArrVal_2248) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| 1))) |c_~#stored_elements~0.base| v_ArrVal_2250) |c_~#queue~0.base|))) (let ((.cse11 (+ (* (select .cse13 .cse3) 4) |c_~#queue~0.offset|))) (or (< .cse11 0) (forall ((v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2256 Int) (v_ArrVal_2255 Int)) (<= (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse12 (store .cse13 .cse11 v_ArrVal_2255))) (store (store .cse12 .cse2 v_ArrVal_2256) .cse3 (+ (select .cse12 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2259) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))) (< .cse17 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143|))) (= 20 .cse17))))) (< (select .cse14 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166|)))))) is different from false [2024-11-21 00:47:13,264 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse13 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse12 .cse13)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse8 (+ |c_~#queue~0.offset| 80)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146|) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| Int) (v_ArrVal_2243 Int) (v_ArrVal_2241 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse12 .cse13 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146| 1))))) (let ((.cse1 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166|) (forall ((v_ArrVal_2246 Int)) (let ((.cse9 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| 4) |c_~#queue~0.offset|))) (let ((.cse11 (select (store (store (store .cse1 .cse5 v_ArrVal_2243) .cse8 .cse9) .cse10 v_ArrVal_2246) .cse2))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| Int) (v_ArrVal_2248 Int)) (or (forall ((v_ArrVal_2250 (Array Int Int))) (let ((.cse6 (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse1 .cse8 .cse9) .cse10 v_ArrVal_2246) .cse5 v_ArrVal_2248) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| 1))) |c_~#stored_elements~0.base| v_ArrVal_2250) |c_~#queue~0.base|))) (let ((.cse7 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2256 Int) (v_ArrVal_2255 Int)) (<= (+ (* (select (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse6 .cse7 v_ArrVal_2255))) (store (store .cse4 .cse5 v_ArrVal_2256) .cse2 (+ (select .cse4 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2259) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< .cse7 0))))) (< .cse11 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143|))) (= 20 .cse11))))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146|) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| Int) (v_ArrVal_2243 Int) (v_ArrVal_2241 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse12 .cse13 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146| 1))))) (let ((.cse14 (select (store .cse16 |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|))) (or (< (select .cse14 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166|) (forall ((v_ArrVal_2246 Int)) (let ((.cse20 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse21 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| 4) |c_~#queue~0.offset|))) (let ((.cse15 (select (store (store (store .cse14 .cse5 v_ArrVal_2243) .cse8 .cse20) .cse21 v_ArrVal_2246) .cse2))) (or (= 20 .cse15) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| Int) (v_ArrVal_2248 Int)) (or (< .cse15 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143|) (forall ((v_ArrVal_2250 (Array Int Int))) (let ((.cse18 (select (store (store .cse16 |c_~#queue~0.base| (store (store (store (store .cse14 .cse8 .cse20) .cse21 v_ArrVal_2246) .cse5 v_ArrVal_2248) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| 1))) |c_~#stored_elements~0.base| v_ArrVal_2250) |c_~#queue~0.base|))) (let ((.cse19 (+ (* (select .cse18 .cse2) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2256 Int) (v_ArrVal_2255 Int)) (<= 0 (+ (* (select (select (store (store .cse16 |c_~#queue~0.base| (let ((.cse17 (store .cse18 .cse19 v_ArrVal_2255))) (store (store .cse17 .cse5 v_ArrVal_2256) .cse2 (+ (select .cse17 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2259) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset|))) (< .cse19 0)))))))))))))))))))) is different from false [2024-11-21 00:47:30,822 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse10 (+ |c_~#queue~0.offset| 80)) (.cse6 (+ 84 |c_~#queue~0.offset|)) (.cse14 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select .cse15 .cse2))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146| Int) (v_ArrVal_2236 Int) (v_ArrVal_2238 Int)) (let ((.cse1 (store .cse15 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169| 4)) v_ArrVal_2236))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146|) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| Int) (v_ArrVal_2243 Int) (v_ArrVal_2241 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse14 v_ArrVal_2238) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146| 1))))) (let ((.cse9 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2246 Int)) (let ((.cse11 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| 4) |c_~#queue~0.offset|))) (let ((.cse13 (select (store (store (store .cse9 .cse5 v_ArrVal_2243) .cse10 .cse11) .cse12 v_ArrVal_2246) .cse6))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| Int) (v_ArrVal_2248 Int)) (or (forall ((v_ArrVal_2250 (Array Int Int))) (let ((.cse7 (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse9 .cse10 .cse11) .cse12 v_ArrVal_2246) .cse5 v_ArrVal_2248) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| 1))) |c_~#stored_elements~0.base| v_ArrVal_2250) |c_~#queue~0.base|))) (let ((.cse8 (+ |c_~#queue~0.offset| (* (select .cse7 .cse6) 4)))) (or (forall ((v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2256 Int) (v_ArrVal_2255 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse7 .cse8 v_ArrVal_2255))) (store (store .cse4 .cse5 v_ArrVal_2256) .cse6 (+ (select .cse4 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2259) |c_~#queue~0.base|) .cse6) 4)) (select |c_#length| |c_~#queue~0.base|))) (< .cse8 0))))) (< .cse13 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143|))) (= 20 .cse13))))) (< (select .cse9 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166|)))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169| Int)) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146| Int) (v_ArrVal_2236 Int) (v_ArrVal_2238 Int)) (let ((.cse24 (store .cse15 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169| 4)) v_ArrVal_2236))) (or (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| Int) (v_ArrVal_2243 Int) (v_ArrVal_2241 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse24 .cse14 v_ArrVal_2238) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146| 1))))) (let ((.cse16 (select (store .cse19 |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|))) (or (< (select .cse16 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166|) (forall ((v_ArrVal_2246 Int)) (let ((.cse22 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse23 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| 4) |c_~#queue~0.offset|))) (let ((.cse17 (select (store (store (store .cse16 .cse5 v_ArrVal_2243) .cse10 .cse22) .cse23 v_ArrVal_2246) .cse6))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| Int) (v_ArrVal_2248 Int)) (or (< .cse17 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143|) (forall ((v_ArrVal_2250 (Array Int Int))) (let ((.cse21 (select (store (store .cse19 |c_~#queue~0.base| (store (store (store (store .cse16 .cse10 .cse22) .cse23 v_ArrVal_2246) .cse5 v_ArrVal_2248) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| 1))) |c_~#stored_elements~0.base| v_ArrVal_2250) |c_~#queue~0.base|))) (let ((.cse18 (+ |c_~#queue~0.offset| (* (select .cse21 .cse6) 4)))) (or (< .cse18 0) (forall ((v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2256 Int) (v_ArrVal_2255 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse19 |c_~#queue~0.base| (let ((.cse20 (store .cse21 .cse18 v_ArrVal_2255))) (store (store .cse20 .cse5 v_ArrVal_2256) .cse6 (+ (select .cse20 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2259) |c_~#queue~0.base|) .cse6) 4)))))))))) (= 20 .cse17))))))))) (< (select .cse24 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146|)))) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169|)))))) is different from false [2024-11-21 00:47:33,058 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse12 .cse2)) (.cse8 (+ |c_~#queue~0.offset| 80)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146| Int) (v_ArrVal_2236 Int) (v_ArrVal_2238 Int)) (let ((.cse1 (store .cse12 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169| 4)) v_ArrVal_2236))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146|) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| Int) (v_ArrVal_2243 Int) (v_ArrVal_2241 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse1 .cse6 v_ArrVal_2238) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146| 1))) |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|))) (or (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166|) (forall ((v_ArrVal_2246 Int)) (let ((.cse9 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| 4) |c_~#queue~0.offset|))) (let ((.cse11 (select (store (store (store .cse3 .cse6 v_ArrVal_2243) .cse8 .cse9) .cse10 v_ArrVal_2246) .cse2))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| Int) (v_ArrVal_2248 Int)) (or (forall ((v_ArrVal_2250 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse3 .cse8 .cse9) .cse10 v_ArrVal_2246) .cse6 v_ArrVal_2248) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| 1))) |c_~#stored_elements~0.base| v_ArrVal_2250) |c_~#queue~0.base|))) (let ((.cse4 (+ |c_~#queue~0.offset| (* (select .cse7 .cse2) 4)))) (or (< .cse4 0) (forall ((v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2256 Int) (v_ArrVal_2255 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse7 .cse4 v_ArrVal_2255))) (store (store .cse5 .cse6 v_ArrVal_2256) .cse2 (+ (select .cse5 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2259) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))) (< .cse11 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143|))) (= .cse11 20))))))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146| Int) (v_ArrVal_2236 Int) (v_ArrVal_2238 Int)) (let ((.cse20 (store .cse12 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169| 4)) v_ArrVal_2236))) (or (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| Int) (v_ArrVal_2243 Int) (v_ArrVal_2241 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse20 .cse6 v_ArrVal_2238) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146| 1))) |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|))) (or (< (select .cse13 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166|) (forall ((v_ArrVal_2246 Int)) (let ((.cse18 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse19 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| 4) |c_~#queue~0.offset|))) (let ((.cse14 (select (store (store (store .cse13 .cse6 v_ArrVal_2243) .cse8 .cse18) .cse19 v_ArrVal_2246) .cse2))) (or (= .cse14 20) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| Int) (v_ArrVal_2248 Int)) (or (forall ((v_ArrVal_2250 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse13 .cse8 .cse18) .cse19 v_ArrVal_2246) .cse6 v_ArrVal_2248) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| 1))) |c_~#stored_elements~0.base| v_ArrVal_2250) |c_~#queue~0.base|))) (let ((.cse15 (+ |c_~#queue~0.offset| (* (select .cse17 .cse2) 4)))) (or (< .cse15 0) (forall ((v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2256 Int) (v_ArrVal_2255 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse16 (store .cse17 .cse15 v_ArrVal_2255))) (store (store .cse16 .cse6 v_ArrVal_2256) .cse2 (+ (select .cse16 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2259) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset|))))))) (< .cse14 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143|)))))))))) (< (select .cse20 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146|))))))))) is different from false [2024-11-21 00:47:35,384 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_~#queue~0.offset| 80)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169| Int) (v_ArrVal_2235 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2235) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146| Int) (v_ArrVal_2236 Int) (v_ArrVal_2238 Int)) (let ((.cse11 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169| 4)) v_ArrVal_2236))) (or (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| Int) (v_ArrVal_2243 Int) (v_ArrVal_2241 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse11 .cse5 v_ArrVal_2238) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146| 1))) |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|))) (or (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166|) (forall ((v_ArrVal_2246 Int)) (let ((.cse8 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| 4) |c_~#queue~0.offset|))) (let ((.cse10 (select (store (store (store .cse2 .cse5 v_ArrVal_2243) .cse7 .cse8) .cse9 v_ArrVal_2246) .cse1))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| Int) (v_ArrVal_2248 Int)) (or (forall ((v_ArrVal_2250 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse2 .cse7 .cse8) .cse9 v_ArrVal_2246) .cse5 v_ArrVal_2248) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| 1))) |c_~#stored_elements~0.base| v_ArrVal_2250) |c_~#queue~0.base|))) (let ((.cse3 (+ |c_~#queue~0.offset| (* (select .cse6 .cse1) 4)))) (or (< .cse3 0) (forall ((v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2256 Int) (v_ArrVal_2255 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse4 (store .cse6 .cse3 v_ArrVal_2255))) (store (store .cse4 .cse5 v_ArrVal_2256) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2259) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))))) (< .cse10 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143|))) (= .cse10 20)))))))) (< (select .cse11 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146|))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169| Int) (v_ArrVal_2235 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2235) |c_~#queue~0.base|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146| Int) (v_ArrVal_2236 Int) (v_ArrVal_2238 Int)) (let ((.cse12 (store .cse20 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169| 4)) v_ArrVal_2236))) (or (< (select .cse12 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146|) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| Int) (v_ArrVal_2243 Int) (v_ArrVal_2241 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse12 .cse5 v_ArrVal_2238) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146| 1))) |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|))) (or (< (select .cse13 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166|) (forall ((v_ArrVal_2246 Int)) (let ((.cse17 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse18 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| 4) |c_~#queue~0.offset|))) (let ((.cse19 (select (store (store (store .cse13 .cse5 v_ArrVal_2243) .cse7 .cse17) .cse18 v_ArrVal_2246) .cse1))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| Int) (v_ArrVal_2248 Int)) (or (forall ((v_ArrVal_2250 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse13 .cse7 .cse17) .cse18 v_ArrVal_2246) .cse5 v_ArrVal_2248) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| 1))) |c_~#stored_elements~0.base| v_ArrVal_2250) |c_~#queue~0.base|))) (let ((.cse14 (+ |c_~#queue~0.offset| (* (select .cse16 .cse1) 4)))) (or (< .cse14 0) (forall ((v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2256 Int) (v_ArrVal_2255 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse15 (store .cse16 .cse14 v_ArrVal_2255))) (store (store .cse15 .cse5 v_ArrVal_2256) .cse1 (+ (select .cse15 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2259) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))) (< .cse19 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143|))) (= .cse19 20))))))))))) (< (select .cse20 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169|)))))) is different from false [2024-11-21 00:47:36,144 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_~#queue~0.offset| 80)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169| Int) (v_ArrVal_2235 (Array Int Int))) (let ((.cse12 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_2235) |c_~#queue~0.base|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146| Int) (v_ArrVal_2236 Int) (v_ArrVal_2238 Int)) (let ((.cse11 (store .cse12 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169| 4)) v_ArrVal_2236))) (or (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| Int) (v_ArrVal_2243 Int) (v_ArrVal_2241 (Array Int Int))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse11 .cse6 v_ArrVal_2238) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146| 1))) |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166|) (forall ((v_ArrVal_2246 Int)) (let ((.cse9 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| 4) |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store (store .cse0 .cse6 v_ArrVal_2243) .cse8 .cse9) .cse10 v_ArrVal_2246) .cse1))) (or (= .cse2 20) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| Int) (v_ArrVal_2248 Int)) (or (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143|) (forall ((v_ArrVal_2250 (Array Int Int))) (let ((.cse7 (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse0 .cse8 .cse9) .cse10 v_ArrVal_2246) .cse6 v_ArrVal_2248) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| 1))) |c_~#stored_elements~0.base| v_ArrVal_2250) |c_~#queue~0.base|))) (let ((.cse3 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|))) (or (< .cse3 0) (forall ((v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2256 Int) (v_ArrVal_2255 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse7 .cse3 v_ArrVal_2255))) (store (store .cse5 .cse6 v_ArrVal_2256) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2259) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|)))))))))))))))) (< (select .cse11 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146|)))) (< (select .cse12 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169| Int) (v_ArrVal_2235 (Array Int Int))) (let ((.cse13 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_2235) |c_~#queue~0.base|))) (or (< (select .cse13 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146| Int) (v_ArrVal_2236 Int) (v_ArrVal_2238 Int)) (let ((.cse14 (store .cse13 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169| 4)) v_ArrVal_2236))) (or (< (select .cse14 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146|) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| Int) (v_ArrVal_2243 Int) (v_ArrVal_2241 (Array Int Int))) (let ((.cse15 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse14 .cse6 v_ArrVal_2238) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146| 1))) |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|))) (or (< (select .cse15 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166|) (forall ((v_ArrVal_2246 Int)) (let ((.cse20 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse21 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| 4) |c_~#queue~0.offset|))) (let ((.cse16 (select (store (store (store .cse15 .cse6 v_ArrVal_2243) .cse8 .cse20) .cse21 v_ArrVal_2246) .cse1))) (or (= .cse16 20) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| Int) (v_ArrVal_2248 Int)) (or (< .cse16 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143|) (forall ((v_ArrVal_2250 (Array Int Int))) (let ((.cse19 (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse15 .cse8 .cse20) .cse21 v_ArrVal_2246) .cse6 v_ArrVal_2248) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| 1))) |c_~#stored_elements~0.base| v_ArrVal_2250) |c_~#queue~0.base|))) (let ((.cse17 (+ (* (select .cse19 .cse1) 4) |c_~#queue~0.offset|))) (or (< .cse17 0) (forall ((v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2256 Int) (v_ArrVal_2255 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse18 (store .cse19 .cse17 v_ArrVal_2255))) (store (store .cse18 .cse6 v_ArrVal_2256) .cse1 (+ (select .cse18 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2259) |c_~#queue~0.base|) .cse1) 4))))))))))))))))))))))))) is different from false [2024-11-21 00:47:56,499 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_~#queue~0.offset| 80)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse15 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse16 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse17 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_2232 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_149| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (store .cse16 .cse17 |t1Thread1of1ForFork0_enqueue_~x#1|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_149|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169| Int) (v_ArrVal_2235 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse15 v_ArrVal_2232) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_149| 1))))) (let ((.cse2 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_2235) |c_~#queue~0.base|))) (or (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146| Int) (v_ArrVal_2236 Int) (v_ArrVal_2238 Int)) (let ((.cse14 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169| 4)) v_ArrVal_2236))) (or (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| Int) (v_ArrVal_2243 Int) (v_ArrVal_2241 (Array Int Int))) (let ((.cse9 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse14 .cse7 v_ArrVal_2238) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146| 1))) |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2246 Int)) (let ((.cse11 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| 4) |c_~#queue~0.offset|))) (let ((.cse13 (select (store (store (store .cse9 .cse7 v_ArrVal_2243) .cse10 .cse11) .cse12 v_ArrVal_2246) .cse3))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| Int) (v_ArrVal_2248 Int)) (or (forall ((v_ArrVal_2250 (Array Int Int))) (let ((.cse8 (select (store (store .cse5 |c_~#queue~0.base| (store (store (store (store .cse9 .cse10 .cse11) .cse12 v_ArrVal_2246) .cse7 v_ArrVal_2248) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| 1))) |c_~#stored_elements~0.base| v_ArrVal_2250) |c_~#queue~0.base|))) (let ((.cse4 (+ |c_~#queue~0.offset| (* (select .cse8 .cse3) 4)))) (or (< .cse4 0) (forall ((v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2256 Int) (v_ArrVal_2255 Int)) (<= 0 (+ (* (select (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse8 .cse4 v_ArrVal_2255))) (store (store .cse6 .cse7 v_ArrVal_2256) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2259) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))))))) (< .cse13 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143|))) (= .cse13 20))))) (< (select .cse9 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166|)))) (< (select .cse14 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146|))))))))))) (forall ((v_ArrVal_2232 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_149| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse18 (store .cse16 .cse17 |t1Thread1of1ForFork0_enqueue_~x#1|))) (or (< (select .cse18 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_149|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169| Int) (v_ArrVal_2235 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse18 .cse15 v_ArrVal_2232) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_149| 1))))) (let ((.cse28 (select (store .cse20 |c_~#stored_elements~0.base| v_ArrVal_2235) |c_~#queue~0.base|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146| Int) (v_ArrVal_2236 Int) (v_ArrVal_2238 Int)) (let ((.cse19 (store .cse28 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169| 4)) v_ArrVal_2236))) (or (< (select .cse19 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146|) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| Int) (v_ArrVal_2243 Int) (v_ArrVal_2241 (Array Int Int))) (let ((.cse24 (select (store (store .cse20 |c_~#queue~0.base| (store (store .cse19 .cse7 v_ArrVal_2238) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146| 1))) |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2246 Int)) (let ((.cse25 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse26 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| 4) |c_~#queue~0.offset|))) (let ((.cse27 (select (store (store (store .cse24 .cse7 v_ArrVal_2243) .cse10 .cse25) .cse26 v_ArrVal_2246) .cse3))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| Int) (v_ArrVal_2248 Int)) (or (forall ((v_ArrVal_2250 (Array Int Int))) (let ((.cse22 (select (store (store .cse20 |c_~#queue~0.base| (store (store (store (store .cse24 .cse10 .cse25) .cse26 v_ArrVal_2246) .cse7 v_ArrVal_2248) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| 1))) |c_~#stored_elements~0.base| v_ArrVal_2250) |c_~#queue~0.base|))) (let ((.cse23 (+ |c_~#queue~0.offset| (* (select .cse22 .cse3) 4)))) (or (forall ((v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2256 Int) (v_ArrVal_2255 Int)) (<= (+ (* (select (select (store (store .cse20 |c_~#queue~0.base| (let ((.cse21 (store .cse22 .cse23 v_ArrVal_2255))) (store (store .cse21 .cse7 v_ArrVal_2256) .cse3 (+ (select .cse21 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2259) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< .cse23 0))))) (< .cse27 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143|))) (= .cse27 20))))) (< (select .cse24 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166|))))))) (< (select .cse28 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169|)))))))))) is different from false [2024-11-21 00:47:58,998 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse15 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (+ |c_~#queue~0.offset| 80)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse14 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse17 (select .cse16 .cse15))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_172| Int)) (or (forall ((v_ArrVal_2232 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_149| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse13 (store .cse16 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_172| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169| Int) (v_ArrVal_2235 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse13 .cse14 v_ArrVal_2232) .cse15 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_149| 1))))) (let ((.cse0 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_2235) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146| Int) (v_ArrVal_2236 Int) (v_ArrVal_2238 Int)) (let ((.cse2 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169| 4)) v_ArrVal_2236))) (or (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146|) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| Int) (v_ArrVal_2243 Int) (v_ArrVal_2241 (Array Int Int))) (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_2238) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146| 1))) |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|))) (or (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166|) (forall ((v_ArrVal_2246 Int)) (let ((.cse10 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| 4) |c_~#queue~0.offset|))) (let ((.cse12 (select (store (store (store .cse3 .cse7 v_ArrVal_2243) .cse9 .cse10) .cse11 v_ArrVal_2246) .cse1))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| Int) (v_ArrVal_2248 Int)) (or (forall ((v_ArrVal_2250 (Array Int Int))) (let ((.cse8 (select (store (store .cse5 |c_~#queue~0.base| (store (store (store (store .cse3 .cse9 .cse10) .cse11 v_ArrVal_2246) .cse7 v_ArrVal_2248) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| 1))) |c_~#stored_elements~0.base| v_ArrVal_2250) |c_~#queue~0.base|))) (let ((.cse4 (+ (* 4 (select .cse8 .cse1)) |c_~#queue~0.offset|))) (or (< .cse4 0) (forall ((v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2256 Int) (v_ArrVal_2255 Int)) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse8 .cse4 v_ArrVal_2255))) (store (store .cse6 .cse7 v_ArrVal_2256) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2259) |c_~#queue~0.base|) .cse1))))))))) (< .cse12 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143|))) (= 20 .cse12))))))))))))))) (< (select .cse13 .cse15) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_149|)))) (< .cse17 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_172|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_172| Int)) (or (forall ((v_ArrVal_2232 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_149| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse28 (store .cse16 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_172| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169| Int) (v_ArrVal_2235 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse28 .cse14 v_ArrVal_2232) .cse15 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_149| 1))))) (let ((.cse18 (select (store .cse21 |c_~#stored_elements~0.base| v_ArrVal_2235) |c_~#queue~0.base|))) (or (< (select .cse18 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146| Int) (v_ArrVal_2236 Int) (v_ArrVal_2238 Int)) (let ((.cse27 (store .cse18 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_169| 4)) v_ArrVal_2236))) (or (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| Int) (v_ArrVal_2243 Int) (v_ArrVal_2241 (Array Int Int))) (let ((.cse24 (select (store (store .cse21 |c_~#queue~0.base| (store (store .cse27 .cse7 v_ArrVal_2238) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146| 1))) |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2246 Int)) (let ((.cse25 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse26 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166| 4) |c_~#queue~0.offset|))) (let ((.cse19 (select (store (store (store .cse24 .cse7 v_ArrVal_2243) .cse9 .cse25) .cse26 v_ArrVal_2246) .cse1))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| Int) (v_ArrVal_2248 Int)) (or (< .cse19 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143|) (forall ((v_ArrVal_2250 (Array Int Int))) (let ((.cse23 (select (store (store .cse21 |c_~#queue~0.base| (store (store (store (store .cse24 .cse9 .cse25) .cse26 v_ArrVal_2246) .cse7 v_ArrVal_2248) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_143| 1))) |c_~#stored_elements~0.base| v_ArrVal_2250) |c_~#queue~0.base|))) (let ((.cse20 (+ (* 4 (select .cse23 .cse1)) |c_~#queue~0.offset|))) (or (< .cse20 0) (forall ((v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2256 Int) (v_ArrVal_2255 Int)) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store (store .cse21 |c_~#queue~0.base| (let ((.cse22 (store .cse23 .cse20 v_ArrVal_2255))) (store (store .cse22 .cse7 v_ArrVal_2256) .cse1 (+ (select .cse22 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2259) |c_~#queue~0.base|) .cse1)) 4) (select |c_#length| |c_~#queue~0.base|))))))))) (= 20 .cse19))))) (< (select .cse24 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_166|)))) (< (select .cse27 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_146|)))))))) (< (select .cse28 .cse15) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_149|)))) (< .cse17 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_172|)))))) is different from false