./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longer.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_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/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_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/config/GemCutterMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/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_a8c9909a-b61e-4f05-9bde-0fce3bd53489/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 f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-5e523f4 [2024-11-21 00:49:40,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 00:49:40,326 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Default.epf [2024-11-21 00:49:40,331 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 00:49:40,332 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 00:49:40,374 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 00:49:40,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 00:49:40,375 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 00:49:40,375 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 00:49:40,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 00:49:40,376 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 00:49:40,376 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 00:49:40,376 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 00:49:40,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 00:49:40,376 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 00:49:40,376 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 00:49:40,376 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 00:49:40,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 00:49:40,377 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-21 00:49:40,377 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-21 00:49:40,379 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-21 00:49:40,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 00:49:40,380 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-21 00:49:40,380 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-21 00:49:40,380 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 00:49:40,381 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-21 00:49:40,381 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 00:49:40,381 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 00:49:40,381 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 00:49:40,381 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 00:49:40,381 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 00:49:40,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-21 00:49:40,381 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 00:49:40,381 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 00:49:40,382 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 00:49:40,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 00:49:40,382 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 00:49:40,382 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-11-21 00:49:40,382 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-21 00:49:40,382 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-21 00:49:40,382 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-21 00:49:40,382 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_a8c9909a-b61e-4f05-9bde-0fce3bd53489/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 -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2024-11-21 00:49:40,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 00:49:40,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 00:49:40,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 00:49:40,689 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 00:49:40,690 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 00:49:40,691 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2024-11-21 00:49:43,788 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/data/1380eeb35/2d1ae8286e4043e584cfeb9d68b7518c/FLAGb5a9d46da [2024-11-21 00:49:44,227 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 00:49:44,227 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/sv-benchmarks/c/pthread/queue_ok_longer.i [2024-11-21 00:49:44,248 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/data/1380eeb35/2d1ae8286e4043e584cfeb9d68b7518c/FLAGb5a9d46da [2024-11-21 00:49:44,267 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/data/1380eeb35/2d1ae8286e4043e584cfeb9d68b7518c [2024-11-21 00:49:44,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 00:49:44,271 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 00:49:44,273 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 00:49:44,273 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 00:49:44,278 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 00:49:44,279 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:49:44" (1/1) ... [2024-11-21 00:49:44,280 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@718b35b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:49:44, skipping insertion in model container [2024-11-21 00:49:44,280 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:49:44" (1/1) ... [2024-11-21 00:49:44,341 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 00:49:44,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 00:49:44,939 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 00:49:45,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 00:49:45,168 INFO L204 MainTranslator]: Completed translation [2024-11-21 00:49:45,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:49:45 WrapperNode [2024-11-21 00:49:45,169 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 00:49:45,170 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 00:49:45,170 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 00:49:45,171 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 00:49:45,178 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:49:45" (1/1) ... [2024-11-21 00:49:45,205 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:49:45" (1/1) ... [2024-11-21 00:49:45,291 INFO L138 Inliner]: procedures = 274, calls = 854, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 999 [2024-11-21 00:49:45,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 00:49:45,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 00:49:45,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 00:49:45,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 00:49:45,300 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:49:45" (1/1) ... [2024-11-21 00:49:45,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:49:45" (1/1) ... [2024-11-21 00:49:45,324 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:49:45" (1/1) ... [2024-11-21 00:49:45,325 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:49:45" (1/1) ... [2024-11-21 00:49:45,382 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:49:45" (1/1) ... [2024-11-21 00:49:45,385 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:49:45" (1/1) ... [2024-11-21 00:49:45,393 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:49:45" (1/1) ... [2024-11-21 00:49:45,402 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:49:45" (1/1) ... [2024-11-21 00:49:45,408 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:49:45" (1/1) ... [2024-11-21 00:49:45,442 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 00:49:45,443 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 00:49:45,443 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 00:49:45,443 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 00:49:45,444 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:49:45" (1/1) ... [2024-11-21 00:49:45,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-21 00:49:45,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:49:45,482 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/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:49:45,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/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:49:45,513 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-21 00:49:45,513 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-21 00:49:45,513 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-21 00:49:45,513 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-21 00:49:45,513 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-21 00:49:45,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-21 00:49:45,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-21 00:49:45,515 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-21 00:49:45,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 00:49:45,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-21 00:49:45,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 00:49:45,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 00:49:45,517 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:49:45,711 INFO L234 CfgBuilder]: Building ICFG [2024-11-21 00:49:45,712 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 00:49:47,571 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-21 00:49:47,572 INFO L283 CfgBuilder]: Performing block encoding [2024-11-21 00:49:55,125 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 00:49:55,125 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-21 00:49:55,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:49:55 BoogieIcfgContainer [2024-11-21 00:49:55,125 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 00:49:55,129 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 00:49:55,130 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 00:49:55,135 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 00:49:55,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:49:44" (1/3) ... [2024-11-21 00:49:55,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b84c235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:49:55, skipping insertion in model container [2024-11-21 00:49:55,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:49:45" (2/3) ... [2024-11-21 00:49:55,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b84c235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:49:55, skipping insertion in model container [2024-11-21 00:49:55,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:49:55" (3/3) ... [2024-11-21 00:49:55,138 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2024-11-21 00:49:55,156 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 00:49:55,158 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_ok_longer.i that has 3 procedures, 119 locations, 1 initial locations, 2 loop locations, and 53 error locations. [2024-11-21 00:49:55,158 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-21 00:49:55,311 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-21 00:49:55,381 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:49:55,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-21 00:49:55,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:49:55,384 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-21 00:49:55,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-21 00:49:55,522 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:49:55,537 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2024-11-21 00:49:55,549 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;@5fda47cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:49:55,550 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2024-11-21 00:49:56,015 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-21 00:49:56,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:49:56,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1267189076, now seen corresponding path program 1 times [2024-11-21 00:49:56,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:49:56,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781764636] [2024-11-21 00:49:56,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:49:56,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:49:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:49:56,809 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:49:56,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:49:56,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781764636] [2024-11-21 00:49:56,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781764636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:49:56,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:49:56,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:49:56,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043823415] [2024-11-21 00:49:56,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:49:56,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:49:56,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:49:56,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:49:56,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:49:56,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:49:56,844 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:49:56,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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:49:56,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:49:57,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:49:57,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 00:49:57,107 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-21 00:49:57,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:49:57,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1267189077, now seen corresponding path program 1 times [2024-11-21 00:49:57,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:49:57,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164577530] [2024-11-21 00:49:57,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:49:57,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:49:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:50:00,673 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:50:00,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:50:00,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164577530] [2024-11-21 00:50:00,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164577530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:50:00,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:50:00,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-21 00:50:00,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931516689] [2024-11-21 00:50:00,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:50:00,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-21 00:50:00,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:50:00,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-21 00:50:00,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-21 00:50:00,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:50:00,679 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:50:00,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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:50:00,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:00,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:50:01,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:01,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:50:01,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 00:50:01,833 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-21 00:50:01,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:50:01,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1654718487, now seen corresponding path program 1 times [2024-11-21 00:50:01,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:50:01,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293702905] [2024-11-21 00:50:01,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:50:01,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:50:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:50:02,260 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:50:02,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:50:02,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293702905] [2024-11-21 00:50:02,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293702905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:50:02,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:50:02,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-21 00:50:02,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774637473] [2024-11-21 00:50:02,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:50:02,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:50:02,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:50:02,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:50:02,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:50:02,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:50:02,263 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:50:02,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 2 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:50:02,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:02,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:50:02,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:50:02,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:02,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:50:02,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:02,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 00:50:02,568 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-21 00:50:02,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:50:02,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1654718486, now seen corresponding path program 1 times [2024-11-21 00:50:02,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:50:02,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915696348] [2024-11-21 00:50:02,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:50:02,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:50:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:50:03,244 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:50:03,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:50:03,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915696348] [2024-11-21 00:50:03,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915696348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:50:03,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:50:03,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:50:03,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288096675] [2024-11-21 00:50:03,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:50:03,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 00:50:03,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:50:03,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 00:50:03,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 00:50:03,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:50:03,247 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:50:03,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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:50:03,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:03,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:50:03,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:03,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:50:03,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:03,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:50:03,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:03,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:03,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 00:50:03,597 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-21 00:50:03,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:50:03,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1918474182, now seen corresponding path program 1 times [2024-11-21 00:50:03,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:50:03,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17235146] [2024-11-21 00:50:03,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:50:03,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:50:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:50:05,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:50:05,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:50:05,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17235146] [2024-11-21 00:50:05,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17235146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:50:05,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:50:05,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-21 00:50:05,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171556111] [2024-11-21 00:50:05,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:50:05,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-21 00:50:05,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:50:05,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-21 00:50:05,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-21 00:50:05,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:50:05,526 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:50:05,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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:50:05,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:05,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:50:05,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:05,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:05,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:50:06,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:06,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:50:06,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:06,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:06,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-21 00:50:06,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 00:50:06,176 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-21 00:50:06,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:50:06,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1309817834, now seen corresponding path program 1 times [2024-11-21 00:50:06,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:50:06,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003907304] [2024-11-21 00:50:06,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:50:06,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:50:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:50:08,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:50:08,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:50:08,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003907304] [2024-11-21 00:50:08,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003907304] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:50:08,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779921464] [2024-11-21 00:50:08,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:50:08,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:50:08,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:50:08,859 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:50:08,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-21 00:50:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:50:09,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 1856 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-21 00:50:09,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:50:09,393 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:50:09,460 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:50:09,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:50:09,772 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:50:09,810 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:50:09,937 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:50:09,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:50:09,994 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:50:10,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:50:10,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 00:50:10,273 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_115 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_115) |c_~#queue~0.base|) .cse0) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_115 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_115) |c_~#queue~0.base|) .cse0) 4)))))) is different from false [2024-11-21 00:50:10,310 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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_115 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_115) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_115 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_115) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2024-11-21 00:50:10,473 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_115 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_115) |c_~#queue~0.base|) .cse4) 4)))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_115 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_115) |c_~#queue~0.base|) .cse4) 4) 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2024-11-21 00:50:10,713 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse4 .cse3)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17|) (forall ((v_ArrVal_110 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_115 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (store .cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17|)) v_ArrVal_110))) (store (store .cse1 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_115) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17|) (forall ((v_ArrVal_110 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_115 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17|)) v_ArrVal_110))) (store (store .cse6 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_115) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|)))))))) is different from false [2024-11-21 00:50:34,983 INFO L349 Elim1Store]: treesize reduction 312, result has 39.3 percent of original size [2024-11-21 00:50:34,984 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 274 treesize of output 393 [2024-11-21 00:50:35,056 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-21 00:50:35,058 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 194 treesize of output 178 [2024-11-21 00:50:35,079 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:50:35,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:50:35,111 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 135 treesize of output 133 [2024-11-21 00:50:35,194 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 43 treesize of output 35 [2024-11-21 00:50:35,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-21 00:50:35,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:50:35,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 192 treesize of output 190 [2024-11-21 00:50:35,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:50:35,877 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 79 treesize of output 71 [2024-11-21 00:50:35,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:50:35,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:50:35,928 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:50:35,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:50:35,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:50:35,995 INFO L349 Elim1Store]: treesize reduction 62, result has 53.0 percent of original size [2024-11-21 00:50:35,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 107 treesize of output 106 [2024-11-21 00:50:36,002 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:50:36,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:50:36,007 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 64 treesize of output 44 [2024-11-21 00:50:36,014 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:50:36,015 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 44 treesize of output 30 [2024-11-21 00:50:36,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2024-11-21 00:50:36,026 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:50:36,029 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 23 treesize of output 15 [2024-11-21 00:50:36,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-21 00:50:36,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779921464] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 00:50:36,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 00:50:36,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12] total 32 [2024-11-21 00:50:36,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502637959] [2024-11-21 00:50:36,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 00:50:36,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-21 00:50:36,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:50:36,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-21 00:50:36,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=719, Unknown=33, NotChecked=236, Total=1122 [2024-11-21 00:50:36,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:50:36,166 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:50:36,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.4545454545454546) internal successors, (81), 33 states have internal predecessors, (81), 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:50:36,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:36,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:50:36,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:36,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:36,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-21 00:50:36,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:50:38,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:38,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:50:38,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:38,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:38,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-21 00:50:38,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:50:38,314 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-21 00:50:38,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-21 00:50:38,495 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-21 00:50:38,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:50:38,495 INFO L85 PathProgramCache]: Analyzing trace with hash -866981963, now seen corresponding path program 1 times [2024-11-21 00:50:38,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:50:38,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776654402] [2024-11-21 00:50:38,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:50:38,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:50:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:50:38,979 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:50:38,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:50:38,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776654402] [2024-11-21 00:50:38,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776654402] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:50:38,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921315678] [2024-11-21 00:50:38,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:50:38,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:50:38,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:50:38,982 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:50:38,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-21 00:50:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:50:39,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 1900 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-21 00:50:39,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:50:39,759 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:50:39,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 00:50:39,993 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:50:39,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921315678] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 00:50:39,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 00:50:39,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2024-11-21 00:50:39,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263329031] [2024-11-21 00:50:39,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 00:50:39,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-21 00:50:39,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:50:39,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-21 00:50:39,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-21 00:50:39,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:50:39,995 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:50:39,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 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:50:39,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:39,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:50:39,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:39,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:39,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-21 00:50:39,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:50:39,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:50:42,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:42,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:50:42,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:42,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:42,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-21 00:50:42,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:50:42,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:50:42,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-21 00:50:42,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-21 00:50:42,811 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-21 00:50:42,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:50:42,811 INFO L85 PathProgramCache]: Analyzing trace with hash 2130676145, now seen corresponding path program 1 times [2024-11-21 00:50:42,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:50:42,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669153927] [2024-11-21 00:50:42,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:50:42,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:50:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:50:43,171 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-21 00:50:43,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:50:43,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669153927] [2024-11-21 00:50:43,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669153927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:50:43,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:50:43,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 00:50:43,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125135863] [2024-11-21 00:50:43,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:50:43,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:50:43,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:50:43,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:50:43,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:50:43,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:50:43,176 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:50:43,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:50:43,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:43,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:50:43,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:43,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:43,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-21 00:50:43,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:50:43,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:50:43,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:50:43,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:43,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:50:43,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:43,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:43,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-21 00:50:43,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:50:43,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:50:43,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:43,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-21 00:50:43,987 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-21 00:50:43,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:50:43,987 INFO L85 PathProgramCache]: Analyzing trace with hash -366881405, now seen corresponding path program 1 times [2024-11-21 00:50:43,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:50:43,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971240475] [2024-11-21 00:50:43,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:50:43,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:50:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:50:44,560 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-21 00:50:44,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:50:44,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971240475] [2024-11-21 00:50:44,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971240475] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:50:44,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727091259] [2024-11-21 00:50:44,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:50:44,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:50:44,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:50:44,564 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:50:44,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-21 00:50:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:50:45,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 2096 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-21 00:50:45,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:50:45,483 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-21 00:50:45,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 00:50:45,862 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-21 00:50:45,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727091259] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 00:50:45,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 00:50:45,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2024-11-21 00:50:45,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318189010] [2024-11-21 00:50:45,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 00:50:45,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-21 00:50:45,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:50:45,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-21 00:50:45,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-21 00:50:45,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:50:45,865 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:50:45,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 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:50:45,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:45,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:50:45,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:45,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:45,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-21 00:50:45,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:50:45,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:50:45,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:45,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:50:46,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:46,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:50:46,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:46,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:46,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-21 00:50:46,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:50:46,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:50:46,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:46,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-21 00:50:46,290 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-21 00:50:46,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-21 00:50:46,475 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-21 00:50:46,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:50:46,475 INFO L85 PathProgramCache]: Analyzing trace with hash 866892484, now seen corresponding path program 1 times [2024-11-21 00:50:46,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:50:46,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744003932] [2024-11-21 00:50:46,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:50:46,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:50:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:50:47,975 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 75 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-21 00:50:47,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:50:47,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744003932] [2024-11-21 00:50:47,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744003932] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:50:47,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935072396] [2024-11-21 00:50:47,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:50:47,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:50:47,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:50:47,978 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:50:47,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-21 00:50:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:50:48,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 2163 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-21 00:50:48,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:50:48,707 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:50:48,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:50:48,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 18 treesize of output 13 [2024-11-21 00:50:48,834 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-21 00:50:48,834 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 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-21 00:50:48,849 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 13 [2024-11-21 00:50:48,871 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 75 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-21 00:50:48,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 00:50:49,142 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_402 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_52| Int) (v_ArrVal_403 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_402) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_52|) (not (= 400 (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_52|)) v_ArrVal_403) .cse1)))))) is different from false [2024-11-21 00:50:49,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:50:49,168 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:50:49,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:50:49,182 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:50:49,192 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:50:49,208 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:50:49,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:50:49,284 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:50:49,421 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 73 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 2 not checked. [2024-11-21 00:50:49,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935072396] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 00:50:49,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 00:50:49,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 21 [2024-11-21 00:50:49,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970659198] [2024-11-21 00:50:49,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 00:50:49,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-21 00:50:49,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:50:49,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-21 00:50:49,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=348, Unknown=1, NotChecked=38, Total=462 [2024-11-21 00:50:49,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:50:49,425 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:50:49,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.818181818181818) internal successors, (106), 21 states have internal predecessors, (106), 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:50:49,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:49,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:50:49,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:49,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:49,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-21 00:50:49,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:50:49,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:50:49,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:49,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-21 00:50:49,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:50:51,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:51,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:50:51,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:51,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:51,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-21 00:50:51,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:50:51,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:50:51,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:51,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-21 00:50:51,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:50:51,218 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-21 00:50:51,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-21 00:50:51,392 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-21 00:50:51,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:50:51,393 INFO L85 PathProgramCache]: Analyzing trace with hash 462249237, now seen corresponding path program 2 times [2024-11-21 00:50:51,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:50:51,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748173908] [2024-11-21 00:50:51,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:50:51,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:50:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:50:54,343 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 45 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-21 00:50:54,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:50:54,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748173908] [2024-11-21 00:50:54,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748173908] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:50:54,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242098187] [2024-11-21 00:50:54,344 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 00:50:54,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:50:54,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:50:54,358 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:50:54,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-21 00:50:55,010 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 00:50:55,010 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 00:50:55,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 2088 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-21 00:50:55,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:50:55,089 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:50:55,134 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 13 [2024-11-21 00:50:55,319 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:50:55,331 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-11-21 00:50:55,331 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:50:55,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:50:55,360 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:50:55,455 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 13 [2024-11-21 00:50:55,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:50:55,496 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:50:55,602 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:50:55,619 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-11-21 00:50:55,620 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:50:55,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:50:55,649 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:50:55,661 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 9 treesize of output 3 [2024-11-21 00:50:55,693 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 42 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-21 00:50:55,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 00:50:55,951 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_499 Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_499) .cse1)))))) is different from false [2024-11-21 00:50:56,084 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_499 Int) (v_ArrVal_498 (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 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_499) .cse1) 400))))) is different from false [2024-11-21 00:50:56,140 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_499 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_498 (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 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_499) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|)))) is different from false [2024-11-21 00:50:56,192 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_499 Int) (v_ArrVal_494 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_498 (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_494)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_499) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|)))) is different from false [2024-11-21 00:50:56,236 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_499 Int) (v_ArrVal_494 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_498 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store .cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_494))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_498) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_499) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|)))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)))) is different from false [2024-11-21 00:50:57,347 INFO L349 Elim1Store]: treesize reduction 312, result has 39.3 percent of original size [2024-11-21 00:50:57,348 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 374 treesize of output 409 [2024-11-21 00:50:57,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:50:57,395 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 295 treesize of output 291 [2024-11-21 00:50:57,421 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:50:57,511 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 43 treesize of output 35 [2024-11-21 00:50:57,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-21 00:50:57,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:50:57,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 198 treesize of output 196 [2024-11-21 00:50:58,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:50:58,154 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 135 treesize of output 119 [2024-11-21 00:50:58,290 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 6 not checked. [2024-11-21 00:50:58,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242098187] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 00:50:58,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 00:50:58,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 15] total 39 [2024-11-21 00:50:58,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956147223] [2024-11-21 00:50:58,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 00:50:58,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-21 00:50:58,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:50:58,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-21 00:50:58,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=978, Unknown=10, NotChecked=350, Total=1560 [2024-11-21 00:50:58,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:50:58,297 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:50:58,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.2) internal successors, (128), 39 states have internal predecessors, (128), 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:50:58,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:58,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:50:58,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:58,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:50:58,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-21 00:50:58,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:50:58,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:50:58,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:50:58,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-21 00:50:58,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:50:58,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:51:01,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:51:01,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:51:01,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:51:01,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:01,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-21 00:51:01,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:51:01,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:51:01,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:51:01,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-21 00:51:01,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:51:01,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-21 00:51:01,666 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-21 00:51:01,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-21 00:51:01,847 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-21 00:51:01,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:51:01,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1200394486, now seen corresponding path program 2 times [2024-11-21 00:51:01,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:51:01,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437236581] [2024-11-21 00:51:01,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:51:01,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:51:02,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:51:06,220 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:51:06,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:51:06,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437236581] [2024-11-21 00:51:06,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437236581] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:51:06,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440927745] [2024-11-21 00:51:06,221 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 00:51:06,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:51:06,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:51:06,223 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:51:06,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-21 00:51:06,705 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 00:51:06,705 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 00:51:06,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 2020 conjuncts, 104 conjuncts are in the unsatisfiable core [2024-11-21 00:51:06,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:51:06,819 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:51:06,905 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:51:07,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:51:07,213 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:51:07,259 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:51:07,392 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:51:07,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:51:07,496 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:51:07,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:51:07,685 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:51:07,732 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:51:07,861 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:51:07,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:51:07,939 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:51:08,118 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:51:08,160 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:51:08,313 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:51:08,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:51:08,388 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:51:08,581 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 00:51:08,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 00:51:08,783 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_590 (Array Int Int))) (<= (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_590 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset|))))) is different from false [2024-11-21 00:51:08,805 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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_590 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_590 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_590) |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:51:08,820 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 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_590 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_590 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_590) |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:51:08,866 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2024-11-21 00:51:08,912 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.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 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_585))) (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_585))) (store (store .cse6 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))))) is different from false [2024-11-21 00:51:11,285 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_585))) (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse3 .cse4 v_ArrVal_585))) (store (store .cse5 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse5 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4))))))) is different from false [2024-11-21 00:51:11,318 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse0 (let ((.cse3 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse2) 4)) v_ArrVal_585)))) (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse4 (let ((.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_585)))) (store (store .cse4 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse4 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4)))))) is different from false [2024-11-21 00:51:11,365 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (let ((.cse4 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse1 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse5 (let ((.cse6 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse5 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4)))))) is different from false [2024-11-21 00:51:13,477 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |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 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 1))))) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (let ((.cse4 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse1 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse5 (let ((.cse6 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse5 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4)))))) is different from false [2024-11-21 00:51:13,570 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse8 (+ (select .cse5 .cse7) 1)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_1 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 .cse8)))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (let ((.cse4 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse3) 4)) v_ArrVal_585)))) (store (store .cse1 .cse2 (+ v_subst_1 1)) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_2 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 .cse8)))) (store .cse9 |c_~#queue~0.base| (let ((.cse10 (let ((.cse11 (select (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse3) 4)) v_ArrVal_585)))) (store (store .cse10 .cse2 (+ v_subst_2 1)) .cse3 (+ (select .cse10 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4))))))) is different from false [2024-11-21 00:51:13,651 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.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 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_579 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store .cse8 .cse9 v_ArrVal_579))) (store (store .cse5 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .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_584) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse3) 4)) v_ArrVal_585)))) (store (store .cse1 .cse2 (+ v_subst_1 1)) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_579 Int)) (<= 0 (+ (* (select (select (store (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (store .cse8 .cse9 v_ArrVal_579))) (store (store .cse13 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .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_584) |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse3) 4)) v_ArrVal_585)))) (store (store .cse11 .cse2 (+ v_subst_2 1)) .cse3 (+ (select .cse11 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))))) is different from false [2024-11-21 00:51:13,717 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse9 (select .cse8 .cse7)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (or (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_579 Int)) (<= 0 (+ (* 4 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store .cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse5 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .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_584) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse1 .cse2 (+ v_subst_2 1)) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset|))) (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (or (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_579 Int)) (<= (+ (* (select (select (store (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (store .cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse13 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .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_584) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse11 .cse2 (+ v_subst_1 1)) .cse3 (+ (select .cse11 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_590) |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:51:38,565 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_578 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_579 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse2 (let ((.cse4 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse5 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ 1 (select .cse5 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse1) 4)) v_ArrVal_585)))) (store (store .cse2 .cse3 (+ v_subst_2 1)) .cse1 (+ (select .cse2 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|)))))) (forall ((v_ArrVal_578 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (let ((.cse6 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (or (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_579 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse9 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse9 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ 1 (select .cse9 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse1) 4)) v_ArrVal_585)))) (store (store .cse7 .cse3 (+ v_subst_1 1)) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |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:51:38,718 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (forall ((v_ArrVal_578 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_579 Int)) (<= (+ (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (let ((.cse5 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse6 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse6 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* 4 (select .cse5 .cse1))) v_ArrVal_585)))) (store (store .cse3 .cse4 (+ v_subst_1 1)) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) (forall ((v_ArrVal_578 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (let ((.cse10 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_579 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse7 (let ((.cse8 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse9 (store .cse10 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse9 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* 4 (select .cse8 .cse1))) v_ArrVal_585)))) (store (store .cse7 .cse4 (+ v_subst_2 1)) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse1) 4)))) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)))))) is different from false [2024-11-21 00:51:38,817 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1)))))) (and (forall ((v_ArrVal_578 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (let ((.cse6 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_579 Int)) (<= 0 (+ (* 4 (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_87|)) v_ArrVal_579))) (store (store .cse5 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse1 .cse2 (+ v_subst_2 1)) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset|))) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)))) (forall ((v_ArrVal_578 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (let ((.cse7 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (or (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_579 Int)) (<= (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse8 (let ((.cse9 (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse10 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse10 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse10 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse8 .cse2 (+ v_subst_1 1)) .cse3 (+ (select .cse8 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |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:51:42,038 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse8 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse11 (select .cse10 .cse9))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int)) (or (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_574 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_574))) (store (store .cse7 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ (select .cse7 .cse9) 1)))))) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|) (forall ((v_ArrVal_585 Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_3 Int) (v_subst_2 Int) (v_ArrVal_579 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (let ((.cse5 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse6 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse6 .cse4 (+ v_subst_3 1)) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) v_ArrVal_585)))) (store (store .cse3 .cse4 (+ v_subst_2 1)) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse1) 4)))))))) (< .cse11 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int)) (or (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_574 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse17 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_574))) (store (store .cse17 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ (select .cse17 .cse9) 1)))))) (let ((.cse12 (select (store .cse13 |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (or (< (select .cse12 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|) (forall ((v_ArrVal_585 Int) (v_ArrVal_590 (Array Int Int)) (v_subst_4 Int) (v_ArrVal_584 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_579 Int)) (<= (+ (* (select (select (store (store .cse13 |c_~#queue~0.base| (let ((.cse14 (let ((.cse15 (select (store (store .cse13 |c_~#queue~0.base| (let ((.cse16 (store .cse12 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse16 .cse4 (+ v_subst_4 1)) .cse1 (+ (select .cse16 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse14 .cse4 (+ v_subst_1 1)) .cse1 (+ (select .cse14 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))) (< .cse11 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)))))) is different from false [2024-11-21 00:51:44,134 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse8 .cse2)) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_574 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) v_ArrVal_574))) (store (store .cse7 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse7 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|) (forall ((v_ArrVal_585 Int) (v_ArrVal_590 (Array Int Int)) (v_subst_4 Int) (v_ArrVal_584 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_579 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse6 (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse6 .cse4 (+ v_subst_4 1)) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse3 .cse4 (+ v_subst_1 1)) .cse2 (+ (select .cse3 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_574 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse13 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) v_ArrVal_574))) (store (store .cse13 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse13 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (or (< (select .cse9 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|) (forall ((v_ArrVal_585 Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_3 Int) (v_subst_2 Int) (v_ArrVal_579 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse10 (let ((.cse11 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse12 (store .cse9 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse12 .cse4 (+ v_subst_3 1)) .cse2 (+ (select .cse12 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* 4 (select .cse11 .cse2))) v_ArrVal_585)))) (store (store .cse10 .cse4 (+ v_subst_2 1)) .cse2 (+ (select .cse10 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4)))))))))))) is different from false [2024-11-21 00:51:46,996 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|)) (.cse10 (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|))) (and (forall ((v_ArrVal_571 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store .cse9 .cse10 v_ArrVal_571)))) (let ((.cse8 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_574 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse6 (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) v_ArrVal_574))) (store (store .cse7 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse7 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_585 Int) (v_ArrVal_590 (Array Int Int)) (v_subst_4 Int) (v_ArrVal_584 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_579 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (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_87|)) v_ArrVal_579))) (store (store .cse5 .cse2 (+ v_subst_4 1)) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse4 (+ (* 4 (select .cse4 .cse3)) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse1 .cse2 (+ v_subst_1 1)) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4)) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)))) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|))))) (forall ((v_ArrVal_571 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store .cse9 .cse10 v_ArrVal_571)))) (let ((.cse17 (select .cse11 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_574 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse15 (select (store (store .cse11 |c_~#queue~0.base| (let ((.cse16 (store .cse17 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) v_ArrVal_574))) (store (store .cse16 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse16 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_585 Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_3 Int) (v_subst_2 Int) (v_ArrVal_579 Int)) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store .cse11 |c_~#queue~0.base| (let ((.cse12 (let ((.cse13 (select (store (store .cse11 |c_~#queue~0.base| (let ((.cse14 (store .cse15 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse14 .cse2 (+ v_subst_3 1)) .cse3 (+ (select .cse14 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse3) 4)) v_ArrVal_585)))) (store (store .cse12 .cse2 (+ v_subst_2 1)) .cse3 (+ (select .cse12 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3))))) (< (select .cse15 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)))) (< (select .cse17 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|))))))) is different from false [2024-11-21 00:51:47,396 INFO L349 Elim1Store]: treesize reduction 312, result has 39.3 percent of original size [2024-11-21 00:51:47,397 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 1279 treesize of output 651 [2024-11-21 00:51:47,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:51:47,452 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 512 treesize of output 508 [2024-11-21 00:51:47,480 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:51:47,528 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 43 treesize of output 35 [2024-11-21 00:51:47,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-21 00:51:47,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:51:47,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 196 treesize of output 194 [2024-11-21 00:51:48,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:51:48,586 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 227 treesize of output 191 [2024-11-21 00:51:48,731 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 14 treesize of output 10 [2024-11-21 00:51:48,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:51:48,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:51:48,748 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:51:48,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:51:48,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:51:48,848 INFO L349 Elim1Store]: treesize reduction 62, result has 53.0 percent of original size [2024-11-21 00:51:48,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 1106 treesize of output 358 [2024-11-21 00:51:48,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:51:48,867 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:51:48,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 110 [2024-11-21 00:51:48,882 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:51:48,883 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 116 treesize of output 90 [2024-11-21 00:51:48,893 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:51:48,897 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 99 treesize of output 79 [2024-11-21 00:51:49,094 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 39 not checked. [2024-11-21 00:51:49,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440927745] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 00:51:49,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 00:51:49,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 26] total 62 [2024-11-21 00:51:49,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877730925] [2024-11-21 00:51:49,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 00:51:49,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-11-21 00:51:49,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:51:49,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-11-21 00:51:49,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1811, Unknown=59, NotChecked=1890, Total=4032 [2024-11-21 00:51:49,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:51:49,104 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:51:49,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 2.3333333333333335) internal successors, (147), 63 states have internal predecessors, (147), 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:51:49,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:51:49,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:51:49,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:51:49,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:51:49,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-21 00:51:49,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:51:49,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:51:49,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:51:49,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-21 00:51:49,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:51:49,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-21 00:51:49,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:52:13,171 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:52:41,124 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (select .cse5 .cse2))) (let ((.cse11 (* .cse6 4))) (let ((.cse10 (select |c_#length| |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse12 (+ .cse11 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (or (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_579 Int)) (<= 0 (+ (* 4 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse0 (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse4 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse4 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse4 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse0 .cse1 (+ v_subst_2 1)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2)) |c_~#queue~0.offset|))) (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (or (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_579 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse9 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse9 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse9 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse7 .cse1 (+ v_subst_1 1)) .cse2 (+ (select .cse7 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset| 4) .cse10)) (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|))) (<= (+ .cse11 |c_~#queue~0.offset| 4) .cse10) (<= 0 .cse12) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse13 (store .cse5 .cse12 v_ArrVal_585))) (store (store .cse13 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse13 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4)) .cse10)) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse14 (store .cse5 .cse12 v_ArrVal_585))) (store (store .cse14 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse14 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse2) 4))))))))) is different from false [2024-11-21 00:52:41,169 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse9 (select .cse8 .cse7))) (let ((.cse14 (* .cse9 4))) (let ((.cse11 (+ .cse14 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse13 (select |c_#length| |c_~#queue~0.base|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (or (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_579 Int)) (<= 0 (+ (* 4 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store .cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse5 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .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_584) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse1 .cse2 (+ v_subst_2 1)) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset|))) (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|))) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse10 (store .cse8 .cse11 v_ArrVal_585))) (store (store .cse10 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse10 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (<= 0 .cse11) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse12 (store .cse8 .cse11 v_ArrVal_585))) (store (store .cse12 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse12 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse13)) (<= (+ .cse14 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (or (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_579 Int)) (<= (+ (* (select (select (store (let ((.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse18 (store .cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_579))) (store (store .cse18 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse18 .cse7) 1)))))) (store .cse15 |c_~#queue~0.base| (let ((.cse16 (let ((.cse17 (select (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_585)))) (store (store .cse16 .cse2 (+ v_subst_1 1)) .cse3 (+ (select .cse16 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse13))))))))) is different from false [2024-11-21 00:52:41,199 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4))) (let ((.cse6 (select |c_#length| |c_~#queue~0.base|)) (.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ .cse12 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_585))) (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) .cse6)) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_579 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (store .cse3 .cse4 v_ArrVal_579))) (store (store .cse11 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse11 .cse2) 1)))))) (store .cse7 |c_~#queue~0.base| (let ((.cse8 (let ((.cse10 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse5) 4)) v_ArrVal_585)))) (store (store .cse8 .cse9 (+ v_subst_1 1)) .cse5 (+ (select .cse8 .cse5) 1))))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse5) 4) 4) .cse6)) (<= (+ .cse12 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_579 Int)) (<= 0 (+ (* (select (select (store (let ((.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse16 (store .cse3 .cse4 v_ArrVal_579))) (store (store .cse16 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse16 .cse2) 1)))))) (store .cse13 |c_~#queue~0.base| (let ((.cse14 (let ((.cse15 (select (store .cse13 |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse5) 4)) v_ArrVal_585)))) (store (store .cse14 .cse9 (+ v_subst_2 1)) .cse5 (+ (select .cse14 .cse5) 1))))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (<= 0 .cse4) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse17 (store .cse3 .cse4 v_ArrVal_585))) (store (store .cse17 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse17 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|)))))) is different from false [2024-11-21 00:52:41,265 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse9 (select |c_#length| |c_~#queue~0.base|)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse8 (+ (select .cse5 .cse7) 1)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_1 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 .cse8)))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (let ((.cse4 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse3) 4)) v_ArrVal_585)))) (store (store .cse1 .cse2 (+ v_subst_1 1)) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4) 4) .cse9)) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 .cse8)) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse9)) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 .cse8)) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_585 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_subst_2 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 .cse8)))) (store .cse10 |c_~#queue~0.base| (let ((.cse11 (let ((.cse12 (select (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_584) |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse3) 4)) v_ArrVal_585)))) (store (store .cse11 .cse2 (+ v_subst_2 1)) .cse3 (+ (select .cse11 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_590) |c_~#queue~0.base|) .cse3) 4))))))) is different from false [2024-11-21 00:52:58,599 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:53:01,018 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:53:03,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-21 00:53:05,813 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:53:09,333 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:53:11,530 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:53:12,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:53:12,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:53:12,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:53:12,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:53:12,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-21 00:53:12,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:53:12,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:53:12,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:53:12,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-21 00:53:12,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:53:12,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-21 00:53:12,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-21 00:53:12,814 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-21 00:53:12,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:53:12,994 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-21 00:53:12,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:53:12,994 INFO L85 PathProgramCache]: Analyzing trace with hash 748257670, now seen corresponding path program 3 times [2024-11-21 00:53:12,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:53:12,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51366496] [2024-11-21 00:53:12,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:53:12,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:53:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:53:14,378 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 32 proven. 15 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-21 00:53:14,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:53:14,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51366496] [2024-11-21 00:53:14,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51366496] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:53:14,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132773302] [2024-11-21 00:53:14,379 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-21 00:53:14,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:53:14,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:53:14,382 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:53:14,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-21 00:53:15,145 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-21 00:53:15,145 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 00:53:15,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 1931 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-21 00:53:15,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:53:16,122 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:53:16,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:53:16,204 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:53:16,337 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 32 proven. 15 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-21 00:53:16,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 00:53:16,483 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_693 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_693) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_693 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_693) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2024-11-21 00:53:16,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:53:16,507 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:53:16,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:53:16,528 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 50 treesize of output 49 [2024-11-21 00:53:16,564 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 14 treesize of output 10 [2024-11-21 00:53:16,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:53:16,574 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:53:16,577 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:53:16,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:53:16,582 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 25 treesize of output 13 [2024-11-21 00:53:17,295 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 70 trivial. 8 not checked. [2024-11-21 00:53:17,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132773302] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 00:53:17,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 00:53:17,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2024-11-21 00:53:17,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996663290] [2024-11-21 00:53:17,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 00:53:17,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-21 00:53:17,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:53:17,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-21 00:53:17,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=283, Unknown=1, NotChecked=34, Total=380 [2024-11-21 00:53:17,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:53:17,298 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:53:17,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 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:53:17,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:53:17,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:53:17,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:53:17,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:53:17,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-21 00:53:17,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:53:17,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:53:17,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:53:17,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-21 00:53:17,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:53:17,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-21 00:53:17,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-11-21 00:53:17,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:53:18,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:53:18,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:53:18,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:53:18,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:53:18,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-21 00:53:18,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:53:18,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:53:18,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:53:18,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-21 00:53:18,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:53:18,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-21 00:53:18,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-21 00:53:18,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:53:18,916 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-21 00:53:19,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-21 00:53:19,092 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-21 00:53:19,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:53:19,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1227643111, now seen corresponding path program 4 times [2024-11-21 00:53:19,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:53:19,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140249885] [2024-11-21 00:53:19,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:53:19,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:53:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:53:21,830 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 75 proven. 28 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-21 00:53:21,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:53:21,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140249885] [2024-11-21 00:53:21,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140249885] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:53:21,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847340140] [2024-11-21 00:53:21,831 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-21 00:53:21,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:53:21,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:53:21,833 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:53:21,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-21 00:53:22,601 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-21 00:53:22,601 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 00:53:22,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 2259 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-21 00:53:22,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:53:23,681 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:53:23,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:53:23,765 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:53:23,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:53:23,964 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:53:24,027 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:53:24,197 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:53:24,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:53:24,284 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:53:24,468 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 83 proven. 20 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-21 00:53:24,468 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 00:53:24,769 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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_818 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_818) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_818 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_818) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))))) is different from false [2024-11-21 00:53:24,962 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_818 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_818) |c_~#queue~0.base|) .cse4) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_818 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_818) |c_~#queue~0.base|) .cse4) 4))))))) is different from false [2024-11-21 00:53:26,535 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_812 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_812) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_818 (Array Int Int)) (v_ArrVal_814 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| 4) |c_~#queue~0.offset|) v_ArrVal_814))) (store (store .cse2 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse2 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_818) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) (forall ((v_ArrVal_812 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| Int)) (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_812) |c_~#queue~0.base|))) (or (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_818 (Array Int Int)) (v_ArrVal_814 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| 4) |c_~#queue~0.offset|) v_ArrVal_814))) (store (store .cse5 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_818) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|)))))))) is different from false [2024-11-21 00:53:26,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:53:26,580 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 114 treesize of output 84 [2024-11-21 00:53:26,659 INFO L349 Elim1Store]: treesize reduction 42, result has 58.0 percent of original size [2024-11-21 00:53:26,659 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 142 treesize of output 156 [2024-11-21 00:53:26,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:53:26,704 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 109 treesize of output 105 [2024-11-21 00:53:26,717 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:53:26,750 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:53:26,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:53:26,818 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:53:26,859 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:53:26,865 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:53:26,867 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-21 00:53:26,873 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:53:26,875 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-21 00:53:26,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:53:26,886 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 117 treesize of output 87 [2024-11-21 00:53:26,890 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:53:26,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:53:26,900 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 3 case distinctions, treesize of input 78 treesize of output 73 [2024-11-21 00:53:26,907 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:53:26,909 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-21 00:53:26,915 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:53:26,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2024-11-21 00:53:26,930 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:53:26,930 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:53:26,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:53:26,934 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-21 00:53:26,941 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:53:26,943 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-21 00:53:27,636 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 24 proven. 55 refuted. 0 times theorem prover too weak. 70 trivial. 24 not checked. [2024-11-21 00:53:27,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847340140] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 00:53:27,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 00:53:27,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 33 [2024-11-21 00:53:27,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288927697] [2024-11-21 00:53:27,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 00:53:27,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-21 00:53:27,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:53:27,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-21 00:53:27,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=790, Unknown=45, NotChecked=186, Total=1190 [2024-11-21 00:53:27,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:53:27,640 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:53:27,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 4.235294117647059) internal successors, (144), 34 states have internal predecessors, (144), 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:53:27,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:53:27,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:53:27,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:53:27,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:53:27,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-21 00:53:27,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:53:27,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:53:27,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:53:27,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-21 00:53:27,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:53:27,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-11-21 00:53:27,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-11-21 00:53:27,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:53:27,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:53:35,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:53:35,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 00:53:35,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:53:35,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 00:53:35,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-21 00:53:35,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 00:53:35,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 00:53:35,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:53:35,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-21 00:53:35,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 00:53:35,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-21 00:53:35,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-21 00:53:35,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 00:53:35,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-21 00:53:35,359 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-21 00:53:35,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-21 00:53:35,539 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-21 00:53:35,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:53:35,540 INFO L85 PathProgramCache]: Analyzing trace with hash 77446393, now seen corresponding path program 5 times [2024-11-21 00:53:35,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:53:35,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398035451] [2024-11-21 00:53:35,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:53:35,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:53:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:53:43,189 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 176 proven. 94 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-21 00:53:43,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:53:43,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398035451] [2024-11-21 00:53:43,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398035451] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 00:53:43,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681650378] [2024-11-21 00:53:43,189 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-21 00:53:43,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 00:53:43,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:53:43,192 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 00:53:43,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c9909a-b61e-4f05-9bde-0fce3bd53489/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-21 00:54:12,836 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2024-11-21 00:54:12,836 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 00:54:12,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 2423 conjuncts, 181 conjuncts are in the unsatisfiable core [2024-11-21 00:54:12,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 00:54:12,982 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:54:13,081 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:54:13,477 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:54:13,523 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:54:13,748 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:54:13,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:54:13,845 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:54:14,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:54:14,114 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:54:14,347 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:54:14,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:54:14,464 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:54:14,734 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:54:14,885 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:54:15,100 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 3 [2024-11-21 00:54:15,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:54:15,172 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:54:15,384 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-21 00:54:15,385 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 1 case distinctions, treesize of input 34 treesize of output 14 [2024-11-21 00:54:15,438 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:54:15,589 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 36 treesize of output 13 [2024-11-21 00:54:15,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:54:15,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 16 treesize of output 11 [2024-11-21 00:54:15,910 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-21 00:54:15,911 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 1 case distinctions, treesize of input 34 treesize of output 14 [2024-11-21 00:54:15,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 23 treesize of output 11 [2024-11-21 00:54:16,057 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 176 proven. 94 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-21 00:54:16,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 00:54:16,600 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 Int) (v_ArrVal_992 Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_992) (not (= 400 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|)))) is different from false [2024-11-21 00:54:16,819 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 Int) (v_ArrVal_992 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|) (not (= 400 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_992))))) is different from false [2024-11-21 00:54:16,880 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 Int) (v_ArrVal_992 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| Int)) (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_988)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_992))))) is different from false [2024-11-21 00:54:16,931 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((v_ArrVal_995 Int) (v_ArrVal_992 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| Int)) (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_988))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|) (not (= 400 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_992))))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153|)))) is different from false [2024-11-21 00:54:23,746 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 Int) (v_ArrVal_987 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| Int) (v_ArrVal_992 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| Int) (v_ArrVal_986 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_986)))) (let ((.cse5 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| 4) |c_~#queue~0.offset|) v_ArrVal_988)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_986) (not (= (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse3) 400)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|) (< (+ (select .cse4 .cse3) 1) v_ArrVal_992) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153|)))))))) is different from false [2024-11-21 00:54:27,438 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 Int) (v_ArrVal_983 Int) (v_ArrVal_987 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| Int) (v_ArrVal_992 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| Int) (v_ArrVal_981 (Array Int Int)) (v_ArrVal_986 Int)) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse8 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (* (select .cse8 .cse2) 4))) (let ((.cse3 (store .cse8 (+ |c_~#queue~0.offset| .cse0) v_ArrVal_983)) (.cse7 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse7 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 v_ArrVal_986)) |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| 4) |c_~#queue~0.offset|) v_ArrVal_988))) (let ((.cse1 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| 1)) .cse2 v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|))) (or (< (select |c_#length| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 4 .cse0)) (not (= 400 (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse2))) (< (+ (select .cse3 .cse2) 1) v_ArrVal_986) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153|) (< (+ (select .cse5 .cse2) 1) v_ArrVal_992) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|)))))))))) is different from false [2024-11-21 00:54:29,224 WARN L851 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|) (forall ((v_ArrVal_995 Int) (v_ArrVal_983 Int) (v_ArrVal_987 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| Int) (v_ArrVal_992 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| Int) (v_ArrVal_981 (Array Int Int)) (v_ArrVal_986 Int)) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))))) (let ((.cse8 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (* (select .cse8 .cse1) 4))) (let ((.cse0 (store .cse8 (+ .cse2 |c_~#queue~0.offset|) v_ArrVal_983)) (.cse7 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse7 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 v_ArrVal_986)) |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| 4) |c_~#queue~0.offset|) v_ArrVal_988))) (let ((.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| 1)) .cse1 v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_986) (< (select |c_#length| |c_~#queue~0.base|) (+ .cse2 |c_~#queue~0.offset| 4)) (not (= 400 (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_992) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153|))))))))))) is different from false [2024-11-21 00:54:29,305 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse10 .cse11))) (or (= 400 .cse0) (forall ((v_ArrVal_995 Int) (v_ArrVal_983 Int) (v_ArrVal_987 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| Int) (v_ArrVal_992 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| Int) (v_ArrVal_981 (Array Int Int)) (v_ArrVal_986 Int)) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse10 .cse11 (+ .cse0 1))))) (let ((.cse9 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (* (select .cse9 .cse2) 4))) (let ((.cse1 (store .cse9 (+ .cse3 |c_~#queue~0.offset|) v_ArrVal_983)) (.cse8 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse1 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 v_ArrVal_986)) |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|))) (let ((.cse5 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| 4) |c_~#queue~0.offset|) v_ArrVal_988))) (let ((.cse4 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse5 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| 1)) .cse2 v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_986) (< (select |c_#length| |c_~#queue~0.base|) (+ .cse3 |c_~#queue~0.offset| 4)) (not (= 400 (select (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse2))) (< (+ (select .cse5 .cse2) 1) v_ArrVal_992) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153|))))))))))))) is different from false [2024-11-21 00:54:29,382 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse11 (select .cse9 .cse10))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| Int) (v_ArrVal_981 (Array Int Int)) (v_ArrVal_986 Int) (v_ArrVal_995 Int) (v_ArrVal_983 Int) (v_ArrVal_987 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| Int) (v_ArrVal_992 Int)) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 (+ .cse11 1))))) (let ((.cse8 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (* (select .cse8 .cse2) 4))) (let ((.cse4 (store .cse8 (+ |c_~#queue~0.offset| .cse0) v_ArrVal_983)) (.cse7 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1)) .cse2 v_ArrVal_986)) |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| 4) |c_~#queue~0.offset|) v_ArrVal_988))) (let ((.cse1 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| 1)) .cse2 v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|))) (or (< (select |c_#length| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| .cse0 4)) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|) (< (+ (select .cse3 .cse2) 1) v_ArrVal_992) (not (= 400 (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse2))) (< (+ (select .cse4 .cse2) 1) v_ArrVal_986) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153|)))))))))) (= 400 .cse11)))) is different from false [2024-11-21 00:54:29,559 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| Int) (v_ArrVal_977 Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| Int) (v_ArrVal_981 (Array Int Int)) (v_ArrVal_986 Int) (v_ArrVal_995 Int) (v_ArrVal_983 Int) (v_ArrVal_987 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| Int) (v_ArrVal_992 Int)) (let ((.cse10 (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_977)) (.cse11 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse10 .cse11))) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse11 (+ .cse0 1))))) (let ((.cse9 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (* 4 (select .cse9 .cse2)))) (let ((.cse1 (store .cse9 (+ .cse6 |c_~#queue~0.offset|) v_ArrVal_983)) (.cse8 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse1 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1)) .cse2 v_ArrVal_986)) |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| 4) |c_~#queue~0.offset|) v_ArrVal_988))) (let ((.cse3 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse5 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| 1)) .cse2 v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|))) (or (= 400 .cse0) (< (+ (select .cse1 .cse2) 1) v_ArrVal_986) (not (= 400 (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse2))) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153|) (< (+ (select .cse5 .cse2) 1) v_ArrVal_992) (< (select |c_#length| |c_~#queue~0.base|) (+ .cse6 |c_~#queue~0.offset| 4))))))))))))) is different from false [2024-11-21 00:54:29,664 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| Int) (v_ArrVal_977 Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| Int) (v_ArrVal_981 (Array Int Int)) (v_ArrVal_986 Int) (v_ArrVal_995 Int) (v_ArrVal_983 Int) (v_ArrVal_987 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| Int) (v_ArrVal_992 Int)) (let ((.cse11 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse10 (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse12 (+ (* (select .cse12 .cse11) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_977)))) (let ((.cse6 (select .cse10 .cse11))) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse11 (+ .cse6 1))))) (let ((.cse9 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (* (select .cse9 .cse1) 4))) (let ((.cse3 (store .cse9 (+ |c_~#queue~0.offset| .cse5) v_ArrVal_983)) (.cse8 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1)) .cse1 v_ArrVal_986)) |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| 4) |c_~#queue~0.offset|) v_ArrVal_988))) (let ((.cse2 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| 1)) .cse1 v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_992) (not (= 400 (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_986) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|) (< (select |c_#length| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 4 .cse5)) (= 400 .cse6))))))))))))) is different from false [2024-11-21 00:54:39,022 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| Int) (v_ArrVal_977 Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| Int) (v_ArrVal_981 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_154| Int) (v_ArrVal_986 Int) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_983 Int) (v_ArrVal_971 Int) (v_ArrVal_987 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| Int) (v_ArrVal_992 Int)) (let ((.cse13 (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_971)) (.cse14 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse13 .cse14))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse13 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse14 (+ .cse0 1))))) (let ((.cse11 (let ((.cse12 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_975) |c_~#queue~0.base|))) (store .cse12 (+ (* 4 (select .cse12 .cse3)) |c_~#queue~0.offset|) v_ArrVal_977)))) (let ((.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (select .cse11 .cse3))) (let ((.cse10 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse11 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_154| 1)) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|))) (let ((.cse4 (* (select .cse10 .cse3) 4))) (let ((.cse2 (store .cse10 (+ .cse4 |c_~#queue~0.offset|) v_ArrVal_983))) (let ((.cse5 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1)) .cse3 v_ArrVal_986)) |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|))) (let ((.cse7 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| 4) |c_~#queue~0.offset|) v_ArrVal_988))) (let ((.cse6 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| 1)) .cse3 v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|))) (or (= 400 .cse0) (= 400 .cse1) (< (+ (select .cse2 .cse3) 1) v_ArrVal_986) (< (select |c_#length| |c_~#queue~0.base|) (+ .cse4 |c_~#queue~0.offset| 4)) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153|) (not (= 400 (select (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse3))) (< (+ (select .cse7 .cse3) 1) v_ArrVal_992) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|)))))))))))))) is different from false [2024-11-21 00:54:39,223 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| Int) (v_ArrVal_977 Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| Int) (v_ArrVal_981 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_154| Int) (v_ArrVal_986 Int) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_983 Int) (v_ArrVal_971 Int) (v_ArrVal_987 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| Int) (v_ArrVal_992 Int)) (let ((.cse14 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse13 (let ((.cse15 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse15 (+ (* (select .cse15 .cse14) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_971)))) (let ((.cse0 (select .cse13 .cse14))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse13 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse14 (+ .cse0 1))))) (let ((.cse11 (let ((.cse12 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_975) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_977)))) (let ((.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse7 (select .cse11 .cse3))) (let ((.cse10 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse11 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_154| 1)) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|))) (let ((.cse1 (* 4 (select .cse10 .cse3)))) (let ((.cse4 (store .cse10 (+ |c_~#queue~0.offset| .cse1) v_ArrVal_983))) (let ((.cse2 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1)) .cse3 v_ArrVal_986)) |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|))) (let ((.cse6 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153| 4) |c_~#queue~0.offset|) v_ArrVal_988))) (let ((.cse5 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146| 1)) .cse3 v_ArrVal_992)) |c_~#stored_elements~0.base| v_ArrVal_993) |c_~#queue~0.base|))) (or (= .cse0 400) (< (select |c_#length| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 4 .cse1)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_153|) (< (+ 1 (select .cse4 .cse3)) v_ArrVal_986) (not (= (select (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150| 4)) v_ArrVal_995) .cse3) 400)) (< (+ (select .cse6 .cse3) 1) v_ArrVal_992) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_150|) (= 400 .cse7))))))))))))))) is different from false [2024-11-21 00:54:55,432 WARN L286 SmtUtils]: Spent 5.03s on a formula simplification. DAG size of input: 296 DAG size of output: 188 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-21 00:54:55,433 INFO L349 Elim1Store]: treesize reduction 1097, result has 38.6 percent of original size [2024-11-21 00:54:55,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 8 new quantified variables, introduced 33 case distinctions, treesize of input 95160 treesize of output 27035 [2024-11-21 00:54:55,980 INFO L224 Elim1Store]: Index analysis took 217 ms [2024-11-21 00:54:56,153 INFO L349 Elim1Store]: treesize reduction 61, result has 11.6 percent of original size [2024-11-21 00:54:56,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 11 case distinctions, treesize of input 4619 treesize of output 4579 [2024-11-21 00:54:57,022 INFO L349 Elim1Store]: treesize reduction 112, result has 22.8 percent of original size [2024-11-21 00:54:57,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 7057 treesize of output 7137 [2024-11-21 00:54:57,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:54:57,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-21 00:54:57,424 INFO L224 Elim1Store]: Index analysis took 104 ms [2024-11-21 00:54:58,123 INFO L349 Elim1Store]: treesize reduction 122, result has 43.3 percent of original size [2024-11-21 00:54:58,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 10 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 29 case distinctions, treesize of input 5459 treesize of output 6029 [2024-11-21 00:54:58,635 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 469 treesize of output 441 [2024-11-21 00:54:58,884 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 569 treesize of output 537 [2024-11-21 00:54:59,216 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 256 treesize of output 208 [2024-11-21 00:54:59,797 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 694 treesize of output 630 [2024-11-21 00:55:00,743 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 25 treesize of output 17 [2024-11-21 00:55:01,059 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 25 treesize of output 17 [2024-11-21 00:55:01,672 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 25 treesize of output 17 [2024-11-21 00:55:11,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:55:11,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1999 treesize of output 1945 [2024-11-21 00:55:25,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 00:55:25,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 11421 treesize of output 11189 [2024-11-21 00:55:33,937 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-21 00:55:33,938 INFO L173 IndexEqualityManager]: detected equality via solver