./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0235-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0235-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5243781ee83706d005235269371a592cabf9c2dbc613c235cbe81d6e89d326d7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 23:30:21,494 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 23:30:21,579 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-27 23:30:21,590 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 23:30:21,590 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 23:30:21,630 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 23:30:21,632 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 23:30:21,632 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 23:30:21,633 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 23:30:21,633 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 23:30:21,634 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 23:30:21,634 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 23:30:21,635 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 23:30:21,635 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 23:30:21,635 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 23:30:21,635 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 23:30:21,635 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 23:30:21,636 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 23:30:21,636 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 23:30:21,636 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 23:30:21,636 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-27 23:30:21,636 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-27 23:30:21,637 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-27 23:30:21,637 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 23:30:21,637 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 23:30:21,637 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 23:30:21,637 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 23:30:21,637 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 23:30:21,637 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 23:30:21,637 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 23:30:21,638 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:30:21,638 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:30:21,638 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:30:21,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:30:21,639 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 23:30:21,639 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:30:21,639 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:30:21,639 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:30:21,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:30:21,640 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 23:30:21,640 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 23:30:21,640 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 23:30:21,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 23:30:21,640 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 23:30:21,640 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 23:30:21,640 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 23:30:21,640 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 23:30:21,641 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5243781ee83706d005235269371a592cabf9c2dbc613c235cbe81d6e89d326d7 [2024-11-27 23:30:21,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 23:30:21,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 23:30:21,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 23:30:21,995 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 23:30:21,997 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 23:30:21,998 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/memsafety/test-0235-2.i [2024-11-27 23:30:25,094 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/data/6cc23b5b8/14deb1497f1447219c8df6f424b43f84/FLAGb4b9ee240 [2024-11-27 23:30:25,428 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 23:30:25,429 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/sv-benchmarks/c/memsafety/test-0235-2.i [2024-11-27 23:30:25,446 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/data/6cc23b5b8/14deb1497f1447219c8df6f424b43f84/FLAGb4b9ee240 [2024-11-27 23:30:25,658 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/data/6cc23b5b8/14deb1497f1447219c8df6f424b43f84 [2024-11-27 23:30:25,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 23:30:25,662 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 23:30:25,664 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 23:30:25,664 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 23:30:25,668 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 23:30:25,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:30:25" (1/1) ... [2024-11-27 23:30:25,669 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a75c367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:25, skipping insertion in model container [2024-11-27 23:30:25,669 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:30:25" (1/1) ... [2024-11-27 23:30:25,719 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 23:30:26,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:30:26,236 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 23:30:26,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:30:26,333 INFO L204 MainTranslator]: Completed translation [2024-11-27 23:30:26,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:26 WrapperNode [2024-11-27 23:30:26,334 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 23:30:26,335 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 23:30:26,335 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 23:30:26,335 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 23:30:26,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:26" (1/1) ... [2024-11-27 23:30:26,356 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:26" (1/1) ... [2024-11-27 23:30:26,386 INFO L138 Inliner]: procedures = 188, calls = 71, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 233 [2024-11-27 23:30:26,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 23:30:26,387 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 23:30:26,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 23:30:26,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 23:30:26,398 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:26" (1/1) ... [2024-11-27 23:30:26,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:26" (1/1) ... [2024-11-27 23:30:26,404 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:26" (1/1) ... [2024-11-27 23:30:26,447 INFO L175 MemorySlicer]: Split 38 memory accesses to 3 slices as follows [2, 10, 26]. 68 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 13 writes are split as follows [0, 1, 12]. [2024-11-27 23:30:26,447 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:26" (1/1) ... [2024-11-27 23:30:26,447 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:26" (1/1) ... [2024-11-27 23:30:26,459 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:26" (1/1) ... [2024-11-27 23:30:26,460 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:26" (1/1) ... [2024-11-27 23:30:26,468 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:26" (1/1) ... [2024-11-27 23:30:26,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:26" (1/1) ... [2024-11-27 23:30:26,476 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:26" (1/1) ... [2024-11-27 23:30:26,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 23:30:26,489 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 23:30:26,489 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 23:30:26,489 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 23:30:26,490 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:26" (1/1) ... [2024-11-27 23:30:26,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:30:26,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:30:26,525 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 23:30:26,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 23:30:26,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-27 23:30:26,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 23:30:26,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-27 23:30:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-27 23:30:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-27 23:30:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-27 23:30:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-27 23:30:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-27 23:30:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2024-11-27 23:30:26,553 INFO L138 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2024-11-27 23:30:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 23:30:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-27 23:30:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-27 23:30:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-27 23:30:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure l0_destroy [2024-11-27 23:30:26,553 INFO L138 BoogieDeclarations]: Found implementation of procedure l0_destroy [2024-11-27 23:30:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 23:30:26,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-27 23:30:26,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-27 23:30:26,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 23:30:26,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 23:30:26,734 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 23:30:26,736 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 23:30:27,524 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2024-11-27 23:30:27,524 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 23:30:27,542 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 23:30:27,542 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-27 23:30:27,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:30:27 BoogieIcfgContainer [2024-11-27 23:30:27,543 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 23:30:27,545 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 23:30:27,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 23:30:27,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 23:30:27,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:30:25" (1/3) ... [2024-11-27 23:30:27,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f122863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:30:27, skipping insertion in model container [2024-11-27 23:30:27,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:26" (2/3) ... [2024-11-27 23:30:27,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f122863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:30:27, skipping insertion in model container [2024-11-27 23:30:27,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:30:27" (3/3) ... [2024-11-27 23:30:27,552 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0235-2.i [2024-11-27 23:30:27,569 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 23:30:27,572 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0235-2.i that has 3 procedures, 233 locations, 1 initial locations, 11 loop locations, and 87 error locations. [2024-11-27 23:30:27,636 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 23:30:27,652 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=PETRI_NET, 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;@e96eb95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 23:30:27,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2024-11-27 23:30:27,659 INFO L276 IsEmpty]: Start isEmpty. Operand has 233 states, 131 states have (on average 1.9083969465648856) internal successors, (250), 218 states have internal predecessors, (250), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-27 23:30:27,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-27 23:30:27,666 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:27,667 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-27 23:30:27,667 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-27 23:30:27,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:27,675 INFO L85 PathProgramCache]: Analyzing trace with hash 7887142, now seen corresponding path program 1 times [2024-11-27 23:30:27,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:27,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690116305] [2024-11-27 23:30:27,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:27,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:27,815 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-27 23:30:27,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:27,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690116305] [2024-11-27 23:30:27,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690116305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:30:27,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:30:27,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:30:27,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139653743] [2024-11-27 23:30:27,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:30:27,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-27 23:30:27,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:30:27,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-27 23:30:27,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 23:30:27,858 INFO L87 Difference]: Start difference. First operand has 233 states, 131 states have (on average 1.9083969465648856) internal successors, (250), 218 states have internal predecessors, (250), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-27 23:30:27,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:27,889 INFO L93 Difference]: Finished difference Result 233 states and 263 transitions. [2024-11-27 23:30:27,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-27 23:30:27,891 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) Word has length 4 [2024-11-27 23:30:27,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:27,898 INFO L225 Difference]: With dead ends: 233 [2024-11-27 23:30:27,898 INFO L226 Difference]: Without dead ends: 231 [2024-11-27 23:30:27,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 23:30:27,907 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:27,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:30:27,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-27 23:30:27,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2024-11-27 23:30:27,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 130 states have (on average 1.823076923076923) internal successors, (237), 216 states have internal predecessors, (237), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-27 23:30:27,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 261 transitions. [2024-11-27 23:30:27,960 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 261 transitions. Word has length 4 [2024-11-27 23:30:27,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:27,960 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 261 transitions. [2024-11-27 23:30:27,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-27 23:30:27,961 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 261 transitions. [2024-11-27 23:30:27,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-27 23:30:27,961 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:27,961 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-27 23:30:27,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 23:30:27,962 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-27 23:30:27,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:27,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1014370765, now seen corresponding path program 1 times [2024-11-27 23:30:27,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:27,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095836642] [2024-11-27 23:30:27,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:27,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:28,158 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-27 23:30:28,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:28,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095836642] [2024-11-27 23:30:28,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095836642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:30:28,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:30:28,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:30:28,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618546043] [2024-11-27 23:30:28,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:30:28,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:30:28,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:30:28,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:30:28,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:30:28,163 INFO L87 Difference]: Start difference. First operand 231 states and 261 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:30:28,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:28,413 INFO L93 Difference]: Finished difference Result 230 states and 260 transitions. [2024-11-27 23:30:28,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:30:28,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-27 23:30:28,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:28,416 INFO L225 Difference]: With dead ends: 230 [2024-11-27 23:30:28,416 INFO L226 Difference]: Without dead ends: 230 [2024-11-27 23:30:28,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:30:28,417 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 4 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:28,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 427 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 23:30:28,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-27 23:30:28,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2024-11-27 23:30:28,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 130 states have (on average 1.8153846153846154) internal successors, (236), 215 states have internal predecessors, (236), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-27 23:30:28,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 260 transitions. [2024-11-27 23:30:28,434 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 260 transitions. Word has length 6 [2024-11-27 23:30:28,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:28,434 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 260 transitions. [2024-11-27 23:30:28,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:30:28,435 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 260 transitions. [2024-11-27 23:30:28,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-27 23:30:28,435 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:28,435 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:30:28,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 23:30:28,435 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-27 23:30:28,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:28,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1380722403, now seen corresponding path program 1 times [2024-11-27 23:30:28,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:28,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486741819] [2024-11-27 23:30:28,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:28,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-27 23:30:28,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [912886718] [2024-11-27 23:30:28,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:28,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:28,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:30:28,501 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:30:28,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 23:30:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:28,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-27 23:30:28,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:30:28,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-27 23:30:28,786 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-27 23:30:28,787 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:30:28,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:28,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486741819] [2024-11-27 23:30:28,788 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-27 23:30:28,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912886718] [2024-11-27 23:30:28,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912886718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:30:28,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:30:28,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 23:30:28,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739138904] [2024-11-27 23:30:28,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:30:28,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 23:30:28,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:30:28,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 23:30:28,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:30:28,790 INFO L87 Difference]: Start difference. First operand 230 states and 260 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:30:29,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:29,054 INFO L93 Difference]: Finished difference Result 239 states and 269 transitions. [2024-11-27 23:30:29,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 23:30:29,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-27 23:30:29,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:29,057 INFO L225 Difference]: With dead ends: 239 [2024-11-27 23:30:29,057 INFO L226 Difference]: Without dead ends: 239 [2024-11-27 23:30:29,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:30:29,060 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 11 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:29,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 679 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 23:30:29,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-27 23:30:29,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2024-11-27 23:30:29,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 138 states have (on average 1.7753623188405796) internal successors, (245), 223 states have internal predecessors, (245), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-27 23:30:29,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 269 transitions. [2024-11-27 23:30:29,098 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 269 transitions. Word has length 7 [2024-11-27 23:30:29,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:29,098 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 269 transitions. [2024-11-27 23:30:29,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:30:29,098 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 269 transitions. [2024-11-27 23:30:29,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-27 23:30:29,100 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:29,100 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:30:29,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-27 23:30:29,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:29,304 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-27 23:30:29,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:29,305 INFO L85 PathProgramCache]: Analyzing trace with hash -282348366, now seen corresponding path program 1 times [2024-11-27 23:30:29,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:29,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744005526] [2024-11-27 23:30:29,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:29,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-27 23:30:29,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [854674034] [2024-11-27 23:30:29,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:29,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:29,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:30:29,423 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:30:29,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 23:30:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:29,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-27 23:30:29,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:30:29,794 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-27 23:30:29,794 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:30:29,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:29,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744005526] [2024-11-27 23:30:29,795 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-27 23:30:29,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854674034] [2024-11-27 23:30:29,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854674034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:30:29,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:30:29,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 23:30:29,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632071604] [2024-11-27 23:30:29,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:30:29,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 23:30:29,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:30:29,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 23:30:29,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:30:29,800 INFO L87 Difference]: Start difference. First operand 239 states and 269 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-27 23:30:29,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:29,862 INFO L93 Difference]: Finished difference Result 251 states and 281 transitions. [2024-11-27 23:30:29,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 23:30:29,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2024-11-27 23:30:29,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:29,864 INFO L225 Difference]: With dead ends: 251 [2024-11-27 23:30:29,864 INFO L226 Difference]: Without dead ends: 241 [2024-11-27 23:30:29,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:30:29,865 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 2 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:29,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 753 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:30:29,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-27 23:30:29,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2024-11-27 23:30:29,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 140 states have (on average 1.7642857142857142) internal successors, (247), 225 states have internal predecessors, (247), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-27 23:30:29,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 271 transitions. [2024-11-27 23:30:29,903 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 271 transitions. Word has length 66 [2024-11-27 23:30:29,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:29,903 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 271 transitions. [2024-11-27 23:30:29,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-27 23:30:29,903 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 271 transitions. [2024-11-27 23:30:29,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-27 23:30:29,906 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:29,906 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:30:29,918 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-27 23:30:30,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:30,114 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-27 23:30:30,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:30,115 INFO L85 PathProgramCache]: Analyzing trace with hash -403824716, now seen corresponding path program 1 times [2024-11-27 23:30:30,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:30,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304950058] [2024-11-27 23:30:30,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:30,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-27 23:30:30,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1254189386] [2024-11-27 23:30:30,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:30,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:30,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:30:30,443 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:30:30,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 23:30:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:30,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-27 23:30:30,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:30:30,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-27 23:30:30,861 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-27 23:30:30,976 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 92 proven. 7 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-27 23:30:30,978 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:30:31,280 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 48 proven. 12 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-27 23:30:31,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:31,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304950058] [2024-11-27 23:30:31,281 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-27 23:30:31,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254189386] [2024-11-27 23:30:31,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254189386] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:30:31,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 23:30:31,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2024-11-27 23:30:31,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606301400] [2024-11-27 23:30:31,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 23:30:31,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 23:30:31,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:30:31,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 23:30:31,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-27 23:30:31,285 INFO L87 Difference]: Start difference. First operand 241 states and 271 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-27 23:30:31,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:31,785 INFO L93 Difference]: Finished difference Result 260 states and 291 transitions. [2024-11-27 23:30:31,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 23:30:31,786 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2024-11-27 23:30:31,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:31,787 INFO L225 Difference]: With dead ends: 260 [2024-11-27 23:30:31,787 INFO L226 Difference]: Without dead ends: 245 [2024-11-27 23:30:31,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2024-11-27 23:30:31,788 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 22 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:31,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1191 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 23:30:31,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-27 23:30:31,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2024-11-27 23:30:31,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 229 states have internal predecessors, (251), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-27 23:30:31,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 275 transitions. [2024-11-27 23:30:31,804 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 275 transitions. Word has length 71 [2024-11-27 23:30:31,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:31,804 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 275 transitions. [2024-11-27 23:30:31,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-27 23:30:31,805 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 275 transitions. [2024-11-27 23:30:31,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-27 23:30:31,808 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:31,808 INFO L218 NwaCegarLoop]: trace histogram [20, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:30:31,819 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-27 23:30:32,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:32,009 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-27 23:30:32,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:32,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1345968334, now seen corresponding path program 2 times [2024-11-27 23:30:32,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:32,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108076861] [2024-11-27 23:30:32,010 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:30:32,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:32,274 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 23:30:32,274 INFO L230 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-27 23:30:32,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [177431405] [2024-11-27 23:30:32,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:30:32,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:32,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:30:32,312 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:30:32,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 23:30:32,901 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 23:30:32,901 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:30:32,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-27 23:30:32,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:30:33,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-27 23:30:33,094 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-27 23:30:33,339 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 243 proven. 78 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-27 23:30:33,339 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:30:33,975 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 79 proven. 74 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-11-27 23:30:33,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:33,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108076861] [2024-11-27 23:30:33,975 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-27 23:30:33,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177431405] [2024-11-27 23:30:33,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177431405] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:30:33,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 23:30:33,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-11-27 23:30:33,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21017174] [2024-11-27 23:30:33,976 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 23:30:33,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-27 23:30:33,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:30:33,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-27 23:30:33,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2024-11-27 23:30:33,978 INFO L87 Difference]: Start difference. First operand 245 states and 275 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-27 23:30:42,366 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification. DAG size of input: 44 DAG size of output: 36 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 23:30:50,547 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification. DAG size of input: 37 DAG size of output: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 23:30:51,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:51,694 INFO L93 Difference]: Finished difference Result 269 states and 305 transitions. [2024-11-27 23:30:51,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-27 23:30:51,694 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 86 [2024-11-27 23:30:51,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:51,696 INFO L225 Difference]: With dead ends: 269 [2024-11-27 23:30:51,696 INFO L226 Difference]: Without dead ends: 254 [2024-11-27 23:30:51,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=307, Invalid=953, Unknown=0, NotChecked=0, Total=1260 [2024-11-27 23:30:51,699 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 31 mSDsluCounter, 2610 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2864 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:51,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2864 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-27 23:30:51,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-27 23:30:51,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2024-11-27 23:30:51,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 153 states have (on average 1.7189542483660132) internal successors, (263), 238 states have internal predecessors, (263), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-27 23:30:51,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 287 transitions. [2024-11-27 23:30:51,714 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 287 transitions. Word has length 86 [2024-11-27 23:30:51,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:51,715 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 287 transitions. [2024-11-27 23:30:51,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-27 23:30:51,716 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 287 transitions. [2024-11-27 23:30:51,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-27 23:30:51,718 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:51,719 INFO L218 NwaCegarLoop]: trace histogram [40, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:30:51,734 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-27 23:30:51,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:51,923 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-27 23:30:51,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:51,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1501472334, now seen corresponding path program 3 times [2024-11-27 23:30:51,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:51,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026903478] [2024-11-27 23:30:51,924 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 23:30:51,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:52,731 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2024-11-27 23:30:52,731 INFO L230 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-27 23:30:52,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1939531778] [2024-11-27 23:30:52,743 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 23:30:52,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:52,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:30:52,745 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:30:52,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-27 23:30:53,025 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-27 23:30:53,025 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:30:53,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-27 23:30:53,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:30:53,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-27 23:30:53,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1070 trivial. 0 not checked. [2024-11-27 23:30:53,102 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:30:53,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:53,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026903478] [2024-11-27 23:30:53,102 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-27 23:30:53,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939531778] [2024-11-27 23:30:53,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939531778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:30:53,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:30:53,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 23:30:53,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244559783] [2024-11-27 23:30:53,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:30:53,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 23:30:53,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:30:53,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 23:30:53,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:30:53,104 INFO L87 Difference]: Start difference. First operand 254 states and 287 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-27 23:30:53,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:53,325 INFO L93 Difference]: Finished difference Result 253 states and 286 transitions. [2024-11-27 23:30:53,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 23:30:53,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 106 [2024-11-27 23:30:53,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:53,328 INFO L225 Difference]: With dead ends: 253 [2024-11-27 23:30:53,328 INFO L226 Difference]: Without dead ends: 253 [2024-11-27 23:30:53,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:30:53,329 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 11 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:53,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 701 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 23:30:53,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-27 23:30:53,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2024-11-27 23:30:53,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 153 states have (on average 1.7124183006535947) internal successors, (262), 237 states have internal predecessors, (262), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-27 23:30:53,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 286 transitions. [2024-11-27 23:30:53,341 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 286 transitions. Word has length 106 [2024-11-27 23:30:53,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:53,344 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 286 transitions. [2024-11-27 23:30:53,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-27 23:30:53,344 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 286 transitions. [2024-11-27 23:30:53,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-27 23:30:53,346 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:53,346 INFO L218 NwaCegarLoop]: trace histogram [42, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:30:53,361 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-27 23:30:53,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:53,547 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-27 23:30:53,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:53,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1552200972, now seen corresponding path program 1 times [2024-11-27 23:30:53,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:53,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778124410] [2024-11-27 23:30:53,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:53,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:55,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 523 proven. 4 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2024-11-27 23:30:55,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:55,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778124410] [2024-11-27 23:30:55,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778124410] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:30:55,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183312710] [2024-11-27 23:30:55,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:55,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:55,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:30:55,382 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:30:55,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-27 23:30:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:55,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 1159 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-27 23:30:55,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:30:55,967 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2024-11-27 23:30:56,029 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-27 23:30:56,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-27 23:30:56,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 493 proven. 1 refuted. 0 times theorem prover too weak. 721 trivial. 33 not checked. [2024-11-27 23:30:56,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:30:56,429 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-27 23:30:56,430 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 12 treesize of output 11 [2024-11-27 23:30:56,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 493 proven. 34 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2024-11-27 23:30:56,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183312710] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:30:56,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:30:56,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 15 [2024-11-27 23:30:56,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546697874] [2024-11-27 23:30:56,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:30:56,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-27 23:30:56,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:30:56,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-27 23:30:56,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=172, Unknown=1, NotChecked=26, Total=240 [2024-11-27 23:30:56,465 INFO L87 Difference]: Start difference. First operand 253 states and 286 transitions. Second operand has 16 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-27 23:30:57,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:57,613 INFO L93 Difference]: Finished difference Result 352 states and 405 transitions. [2024-11-27 23:30:57,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 23:30:57,614 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 115 [2024-11-27 23:30:57,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:57,617 INFO L225 Difference]: With dead ends: 352 [2024-11-27 23:30:57,617 INFO L226 Difference]: Without dead ends: 352 [2024-11-27 23:30:57,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 222 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=277, Unknown=1, NotChecked=34, Total=380 [2024-11-27 23:30:57,618 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 457 mSDsluCounter, 1637 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1845 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 370 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:57,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1845 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1025 Invalid, 0 Unknown, 370 Unchecked, 1.0s Time] [2024-11-27 23:30:57,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-27 23:30:57,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 251. [2024-11-27 23:30:57,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 153 states have (on average 1.6993464052287581) internal successors, (260), 235 states have internal predecessors, (260), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-27 23:30:57,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 284 transitions. [2024-11-27 23:30:57,631 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 284 transitions. Word has length 115 [2024-11-27 23:30:57,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:57,631 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 284 transitions. [2024-11-27 23:30:57,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-27 23:30:57,632 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 284 transitions. [2024-11-27 23:30:57,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-27 23:30:57,633 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:57,633 INFO L218 NwaCegarLoop]: trace histogram [42, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:30:57,644 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-27 23:30:57,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:57,837 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-27 23:30:57,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:57,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1552200973, now seen corresponding path program 1 times [2024-11-27 23:30:57,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:57,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66443272] [2024-11-27 23:30:57,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:57,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:31:01,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 493 proven. 70 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2024-11-27 23:31:01,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:31:01,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66443272] [2024-11-27 23:31:01,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66443272] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:31:01,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294374940] [2024-11-27 23:31:01,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:31:01,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:31:01,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:31:01,463 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:31:01,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-27 23:31:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:31:03,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 1159 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-11-27 23:31:03,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:31:04,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 9 [2024-11-27 23:31:08,521 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2024-11-27 23:31:08,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:31:08,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-11-27 23:31:08,615 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-27 23:31:08,616 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 11 treesize of output 11 [2024-11-27 23:31:08,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 405 proven. 352 refuted. 0 times theorem prover too weak. 433 trivial. 58 not checked. [2024-11-27 23:31:08,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:31:08,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294374940] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:31:08,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 23:31:08,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 29] total 47 [2024-11-27 23:31:08,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079419087] [2024-11-27 23:31:08,969 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 23:31:08,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-27 23:31:08,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:31:08,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-27 23:31:08,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2195, Unknown=1, NotChecked=94, Total=2450 [2024-11-27 23:31:08,972 INFO L87 Difference]: Start difference. First operand 251 states and 284 transitions. Second operand has 48 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 43 states have internal predecessors, (83), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-27 23:31:13,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-27 23:31:23,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:31:23,375 INFO L93 Difference]: Finished difference Result 381 states and 445 transitions. [2024-11-27 23:31:23,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-27 23:31:23,376 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 43 states have internal predecessors, (83), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 115 [2024-11-27 23:31:23,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:31:23,379 INFO L225 Difference]: With dead ends: 381 [2024-11-27 23:31:23,379 INFO L226 Difference]: Without dead ends: 381 [2024-11-27 23:31:23,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=344, Invalid=4351, Unknown=1, NotChecked=134, Total=4830 [2024-11-27 23:31:23,382 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 388 mSDsluCounter, 2215 mSDsCounter, 0 mSdLazyCounter, 6734 mSolverCounterSat, 29 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 2336 SdHoareTripleChecker+Invalid, 7153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 6734 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 389 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2024-11-27 23:31:23,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 2336 Invalid, 7153 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 6734 Invalid, 1 Unknown, 389 Unchecked, 11.7s Time] [2024-11-27 23:31:23,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-27 23:31:23,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 249. [2024-11-27 23:31:23,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 153 states have (on average 1.6862745098039216) internal successors, (258), 233 states have internal predecessors, (258), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-27 23:31:23,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 282 transitions. [2024-11-27 23:31:23,396 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 282 transitions. Word has length 115 [2024-11-27 23:31:23,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:31:23,397 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 282 transitions. [2024-11-27 23:31:23,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 43 states have internal predecessors, (83), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-27 23:31:23,397 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 282 transitions. [2024-11-27 23:31:23,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-27 23:31:23,399 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:31:23,399 INFO L218 NwaCegarLoop]: trace histogram [42, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:31:23,428 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-27 23:31:23,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:31:23,600 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-27 23:31:23,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:31:23,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1311489837, now seen corresponding path program 1 times [2024-11-27 23:31:23,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:31:23,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991083573] [2024-11-27 23:31:23,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:31:23,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:31:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:31:25,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 698 proven. 96 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2024-11-27 23:31:25,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:31:25,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991083573] [2024-11-27 23:31:25,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991083573] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:31:25,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574918467] [2024-11-27 23:31:25,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:31:25,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:31:25,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:31:25,594 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:31:25,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-27 23:31:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:31:26,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-27 23:31:26,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:31:26,287 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2024-11-27 23:31:26,379 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-27 23:31:26,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-27 23:31:26,464 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-27 23:31:26,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-27 23:31:26,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 638 proven. 2 refuted. 0 times theorem prover too weak. 488 trivial. 120 not checked. [2024-11-27 23:31:26,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:31:27,130 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-27 23:31:27,130 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 12 treesize of output 11 [2024-11-27 23:31:27,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 638 proven. 122 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2024-11-27 23:31:27,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574918467] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:31:27,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:31:27,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 11] total 22 [2024-11-27 23:31:27,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119604367] [2024-11-27 23:31:27,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:31:27,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-27 23:31:27,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:31:27,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-27 23:31:27,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=403, Unknown=1, NotChecked=40, Total=506 [2024-11-27 23:31:27,155 INFO L87 Difference]: Start difference. First operand 249 states and 282 transitions. Second operand has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 20 states have internal predecessors, (73), 3 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-27 23:31:29,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:31:29,031 INFO L93 Difference]: Finished difference Result 347 states and 400 transitions. [2024-11-27 23:31:29,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 23:31:29,031 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 20 states have internal predecessors, (73), 3 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 117 [2024-11-27 23:31:29,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:31:29,034 INFO L225 Difference]: With dead ends: 347 [2024-11-27 23:31:29,034 INFO L226 Difference]: Without dead ends: 347 [2024-11-27 23:31:29,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 224 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=606, Unknown=1, NotChecked=50, Total=756 [2024-11-27 23:31:29,035 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 141 mSDsluCounter, 2763 mSDsCounter, 0 mSdLazyCounter, 1874 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 2960 SdHoareTripleChecker+Invalid, 2253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 365 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-27 23:31:29,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 2960 Invalid, 2253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1874 Invalid, 0 Unknown, 365 Unchecked, 1.6s Time] [2024-11-27 23:31:29,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-27 23:31:29,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 246. [2024-11-27 23:31:29,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 153 states have (on average 1.6666666666666667) internal successors, (255), 230 states have internal predecessors, (255), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-27 23:31:29,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 279 transitions. [2024-11-27 23:31:29,045 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 279 transitions. Word has length 117 [2024-11-27 23:31:29,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:31:29,046 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 279 transitions. [2024-11-27 23:31:29,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 20 states have internal predecessors, (73), 3 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-27 23:31:29,046 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 279 transitions. [2024-11-27 23:31:29,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-27 23:31:29,047 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:31:29,048 INFO L218 NwaCegarLoop]: trace histogram [42, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:31:29,062 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-27 23:31:29,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:31:29,252 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-27 23:31:29,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:31:29,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1311489838, now seen corresponding path program 1 times [2024-11-27 23:31:29,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:31:29,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229118189] [2024-11-27 23:31:29,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:31:29,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:31:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:31:33,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 638 proven. 192 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2024-11-27 23:31:33,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:31:33,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229118189] [2024-11-27 23:31:33,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229118189] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:31:33,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187557456] [2024-11-27 23:31:33,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:31:33,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:31:33,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:31:33,183 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:31:33,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-27 23:31:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:31:34,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 126 conjuncts are in the unsatisfiable core [2024-11-27 23:31:34,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:31:35,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 9 [2024-11-27 23:31:37,947 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|) (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2024-11-27 23:31:38,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:31:38,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-27 23:31:38,869 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 23:31:38,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-27 23:31:39,068 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2024-11-27 23:31:39,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:31:39,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-27 23:31:39,169 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-27 23:31:39,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-27 23:31:39,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 386 proven. 569 refuted. 0 times theorem prover too weak. 117 trivial. 176 not checked. [2024-11-27 23:31:39,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:31:39,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187557456] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:31:39,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 23:31:39,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 38] total 59 [2024-11-27 23:31:39,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678220023] [2024-11-27 23:31:39,630 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 23:31:39,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-11-27 23:31:39,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:31:39,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-11-27 23:31:39,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=3351, Unknown=2, NotChecked=234, Total=3782 [2024-11-27 23:31:39,633 INFO L87 Difference]: Start difference. First operand 246 states and 279 transitions. Second operand has 60 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 57 states have internal predecessors, (113), 4 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-27 23:31:43,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-27 23:31:48,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-27 23:31:52,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-27 23:31:57,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-27 23:32:01,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-27 23:32:05,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-27 23:32:10,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-27 23:32:14,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-27 23:32:26,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:32:26,059 INFO L93 Difference]: Finished difference Result 352 states and 408 transitions. [2024-11-27 23:32:26,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-27 23:32:26,059 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 57 states have internal predecessors, (113), 4 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) Word has length 117 [2024-11-27 23:32:26,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:32:26,061 INFO L225 Difference]: With dead ends: 352 [2024-11-27 23:32:26,061 INFO L226 Difference]: Without dead ends: 352 [2024-11-27 23:32:26,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1553 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=432, Invalid=5580, Unknown=2, NotChecked=306, Total=6320 [2024-11-27 23:32:26,064 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 403 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 5977 mSolverCounterSat, 29 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1831 SdHoareTripleChecker+Invalid, 6754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 5977 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 740 IncrementalHoareTripleChecker+Unchecked, 41.5s IncrementalHoareTripleChecker+Time [2024-11-27 23:32:26,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1831 Invalid, 6754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 5977 Invalid, 8 Unknown, 740 Unchecked, 41.5s Time] [2024-11-27 23:32:26,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-27 23:32:26,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 243. [2024-11-27 23:32:26,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 153 states have (on average 1.6470588235294117) internal successors, (252), 227 states have internal predecessors, (252), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-27 23:32:26,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 276 transitions. [2024-11-27 23:32:26,074 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 276 transitions. Word has length 117 [2024-11-27 23:32:26,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:32:26,075 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 276 transitions. [2024-11-27 23:32:26,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 57 states have internal predecessors, (113), 4 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-27 23:32:26,075 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 276 transitions. [2024-11-27 23:32:26,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-27 23:32:26,076 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:32:26,076 INFO L218 NwaCegarLoop]: trace histogram [42, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:32:26,101 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-27 23:32:26,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-27 23:32:26,277 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-27 23:32:26,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:32:26,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1991033337, now seen corresponding path program 1 times [2024-11-27 23:32:26,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:32:26,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450141494] [2024-11-27 23:32:26,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:32:26,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:32:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:32:28,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 695 proven. 188 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2024-11-27 23:32:28,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:32:28,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450141494] [2024-11-27 23:32:28,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450141494] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:32:28,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982742045] [2024-11-27 23:32:28,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:32:28,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:32:28,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:32:28,340 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:32:28,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-27 23:32:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:32:28,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 1221 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-27 23:32:28,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:32:29,144 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_#t~ret9#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from false [2024-11-27 23:32:29,147 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_#t~ret9#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from true [2024-11-27 23:32:29,164 WARN L851 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) is different from false [2024-11-27 23:32:29,167 WARN L873 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) is different from true [2024-11-27 23:32:29,191 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from false [2024-11-27 23:32:29,195 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from true [2024-11-27 23:32:29,362 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse0) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |c_#valid| .cse0)))))) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |c_#valid| .cse2))))))) is different from false [2024-11-27 23:32:29,367 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse0) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |c_#valid| .cse0)))))) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |c_#valid| .cse2))))))) is different from true [2024-11-27 23:32:29,456 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |c_#valid| .cse0)))))) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |c_#valid| .cse2))))))) is different from false [2024-11-27 23:32:29,461 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |c_#valid| .cse0)))))) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |c_#valid| .cse2))))))) is different from true [2024-11-27 23:32:29,533 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2024-11-27 23:32:29,616 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-27 23:32:29,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-27 23:32:29,735 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) is different from false [2024-11-27 23:32:29,740 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) is different from true [2024-11-27 23:32:29,930 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) is different from false [2024-11-27 23:32:29,935 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) is different from true [2024-11-27 23:32:30,237 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (let ((.cse1 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse0) 1) (= (store |v_#valid_BEFORE_CALL_17| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse4) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |v_old(#valid)_AFTER_CALL_52| .cse4)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse1 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) is different from false [2024-11-27 23:32:30,246 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (let ((.cse1 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse0) 1) (= (store |v_#valid_BEFORE_CALL_17| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse4) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |v_old(#valid)_AFTER_CALL_52| .cse4)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse1 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) is different from true [2024-11-27 23:32:30,615 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (exists ((v_ArrVal_3620 Int)) (= (select |c_#valid| v_ArrVal_3620) 1))) (.cse4 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse0 (select |v_old(#valid)_AFTER_CALL_51| .cse0))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (and .cse2 (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse3) 1) (= (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_52| .cse3)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) (and .cse2 (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse5 (select |v_old(#valid)_AFTER_CALL_52| .cse5)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse5) 1)))) .cse4))) is different from false [2024-11-27 23:32:30,621 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (exists ((v_ArrVal_3620 Int)) (= (select |c_#valid| v_ArrVal_3620) 1))) (.cse4 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse0 (select |v_old(#valid)_AFTER_CALL_51| .cse0))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (and .cse2 (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse3) 1) (= (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_52| .cse3)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) (and .cse2 (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse5 (select |v_old(#valid)_AFTER_CALL_52| .cse5)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse5) 1)))) .cse4))) is different from true [2024-11-27 23:32:30,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 605 proven. 179 refuted. 0 times theorem prover too weak. 365 trivial. 99 not checked. [2024-11-27 23:32:30,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:32:31,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982742045] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:32:31,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 23:32:31,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 32 [2024-11-27 23:32:31,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616583237] [2024-11-27 23:32:31,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 23:32:31,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-27 23:32:31,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:32:31,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-27 23:32:31,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=576, Unknown=19, NotChecked=570, Total=1260 [2024-11-27 23:32:31,132 INFO L87 Difference]: Start difference. First operand 243 states and 276 transitions. Second operand has 33 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 26 states have internal predecessors, (80), 6 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-27 23:32:31,730 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_#t~ret9#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) .cse1) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~item~2#1.base|) 1) .cse1)) is different from false [2024-11-27 23:32:31,733 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_#t~ret9#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) .cse1) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~item~2#1.base|) 1) .cse1)) is different from true [2024-11-27 23:32:31,737 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0))) is different from false [2024-11-27 23:32:31,740 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0))) is different from true [2024-11-27 23:32:31,747 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)) (or (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) .cse0))) is different from false [2024-11-27 23:32:31,750 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)) (or (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) .cse0))) is different from true [2024-11-27 23:32:31,774 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse0) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |c_#valid| .cse0)))))) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) .cse2 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse3) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse4) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_old(#valid)_AFTER_CALL_51| .cse4))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse3 (select |c_#valid| .cse3))))))) (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) .cse2 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from false [2024-11-27 23:32:31,778 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse0) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |c_#valid| .cse0)))))) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) .cse2 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse3) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse4) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_old(#valid)_AFTER_CALL_51| .cse4))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse3 (select |c_#valid| .cse3))))))) (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) .cse2 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from true [2024-11-27 23:32:31,795 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|) .cse0 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)) (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |c_#valid| .cse1)))))) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) .cse0 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse4) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_old(#valid)_AFTER_CALL_51| .cse4))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse3 (select |c_#valid| .cse3))))))))) is different from false [2024-11-27 23:32:31,800 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|) .cse0 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)) (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |c_#valid| .cse1)))))) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) .cse0 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse4) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_old(#valid)_AFTER_CALL_51| .cse4))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse3 (select |c_#valid| .cse3))))))))) is different from true [2024-11-27 23:32:31,894 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse4)) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|) .cse4 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from false [2024-11-27 23:32:31,899 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse4)) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|) .cse4 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from true [2024-11-27 23:32:31,962 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse4)) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or .cse4 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from false [2024-11-27 23:32:31,967 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse4)) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or .cse4 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from true [2024-11-27 23:32:32,045 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (let ((.cse1 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse0) 1) (= (store |v_#valid_BEFORE_CALL_17| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse4) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |v_old(#valid)_AFTER_CALL_52| .cse4)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse1 .cse5))) .cse5)) is different from false [2024-11-27 23:32:32,050 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (let ((.cse1 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse0) 1) (= (store |v_#valid_BEFORE_CALL_17| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse4) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |v_old(#valid)_AFTER_CALL_52| .cse4)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse1 .cse5))) .cse5)) is different from true [2024-11-27 23:32:32,125 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and .cse0 (let ((.cse3 (exists ((v_ArrVal_3620 Int)) (= (select |c_#valid| v_ArrVal_3620) 1))) (.cse5 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|)) (.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_old(#valid)_AFTER_CALL_51| .cse1))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (and .cse3 (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse4) 1) (= (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_old(#valid)_AFTER_CALL_52| .cse4)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) (and .cse3 (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse5 .cse0) (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse6 (select |v_old(#valid)_AFTER_CALL_52| .cse6)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse6) 1)))) .cse5))))) is different from false [2024-11-27 23:32:32,131 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and .cse0 (let ((.cse3 (exists ((v_ArrVal_3620 Int)) (= (select |c_#valid| v_ArrVal_3620) 1))) (.cse5 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|)) (.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_old(#valid)_AFTER_CALL_51| .cse1))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (and .cse3 (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse4) 1) (= (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_old(#valid)_AFTER_CALL_52| .cse4)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) (and .cse3 (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse5 .cse0) (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse6 (select |v_old(#valid)_AFTER_CALL_52| .cse6)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse6) 1)))) .cse5))))) is different from true [2024-11-27 23:32:34,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:32:34,137 INFO L93 Difference]: Finished difference Result 363 states and 422 transitions. [2024-11-27 23:32:34,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-27 23:32:34,137 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 26 states have internal predecessors, (80), 6 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) Word has length 123 [2024-11-27 23:32:34,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:32:34,139 INFO L225 Difference]: With dead ends: 363 [2024-11-27 23:32:34,139 INFO L226 Difference]: Without dead ends: 363 [2024-11-27 23:32:34,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 126 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=148, Invalid=821, Unknown=37, NotChecked=1444, Total=2450 [2024-11-27 23:32:34,140 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 680 mSDsluCounter, 2672 mSDsCounter, 0 mSdLazyCounter, 1793 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 2878 SdHoareTripleChecker+Invalid, 6184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4309 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:32:34,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 2878 Invalid, 6184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1793 Invalid, 0 Unknown, 4309 Unchecked, 2.2s Time] [2024-11-27 23:32:34,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-27 23:32:34,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 262. [2024-11-27 23:32:34,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 169 states have (on average 1.6035502958579881) internal successors, (271), 243 states have internal predecessors, (271), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-27 23:32:34,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 301 transitions. [2024-11-27 23:32:34,154 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 301 transitions. Word has length 123 [2024-11-27 23:32:34,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:32:34,155 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 301 transitions. [2024-11-27 23:32:34,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 26 states have internal predecessors, (80), 6 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-27 23:32:34,155 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 301 transitions. [2024-11-27 23:32:34,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-27 23:32:34,156 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:32:34,157 INFO L218 NwaCegarLoop]: trace histogram [42, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:32:34,170 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-27 23:32:34,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-27 23:32:34,357 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-27 23:32:34,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:32:34,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1991033338, now seen corresponding path program 1 times [2024-11-27 23:32:34,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:32:34,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465898174] [2024-11-27 23:32:34,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:32:34,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:32:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:32:39,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 605 proven. 402 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-11-27 23:32:39,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:32:39,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465898174] [2024-11-27 23:32:39,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465898174] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:32:39,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126156866] [2024-11-27 23:32:39,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:32:39,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:32:39,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:32:39,271 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:32:39,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-27 23:32:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:32:40,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 1221 conjuncts, 160 conjuncts are in the unsatisfiable core [2024-11-27 23:32:40,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:32:41,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 9 [2024-11-27 23:32:46,178 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-27 23:32:46,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-27 23:32:46,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-27 23:32:46,811 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-27 23:32:46,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2024-11-27 23:32:46,862 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-27 23:32:46,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-27 23:32:47,366 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2024-11-27 23:32:47,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:32:47,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-27 23:32:47,469 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-27 23:32:47,469 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 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-27 23:32:48,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 227 proven. 786 refuted. 0 times theorem prover too weak. 91 trivial. 144 not checked. [2024-11-27 23:32:48,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:32:48,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126156866] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:32:48,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 23:32:48,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 44] total 72 [2024-11-27 23:32:48,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400840397] [2024-11-27 23:32:48,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 23:32:48,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2024-11-27 23:32:48,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:32:48,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2024-11-27 23:32:48,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=5096, Unknown=1, NotChecked=144, Total=5550 [2024-11-27 23:32:48,555 INFO L87 Difference]: Start difference. First operand 262 states and 301 transitions. Second operand has 73 states, 69 states have (on average 1.9710144927536233) internal successors, (136), 66 states have internal predecessors, (136), 5 states have call successors, (9), 2 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-27 23:32:52,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-27 23:33:11,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:33:11,322 INFO L93 Difference]: Finished difference Result 365 states and 426 transitions. [2024-11-27 23:33:11,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-27 23:33:11,323 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 69 states have (on average 1.9710144927536233) internal successors, (136), 66 states have internal predecessors, (136), 5 states have call successors, (9), 2 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) Word has length 123 [2024-11-27 23:33:11,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:33:11,324 INFO L225 Difference]: With dead ends: 365 [2024-11-27 23:33:11,324 INFO L226 Difference]: Without dead ends: 365 [2024-11-27 23:33:11,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2565 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=614, Invalid=8701, Unknown=1, NotChecked=190, Total=9506 [2024-11-27 23:33:11,327 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 764 mSDsluCounter, 1859 mSDsCounter, 0 mSdLazyCounter, 7664 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 1956 SdHoareTripleChecker+Invalid, 8083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 7664 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 356 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2024-11-27 23:33:11,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 1956 Invalid, 8083 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [62 Valid, 7664 Invalid, 1 Unknown, 356 Unchecked, 16.4s Time] [2024-11-27 23:33:11,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-27 23:33:11,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 237. [2024-11-27 23:33:11,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 153 states have (on average 1.607843137254902) internal successors, (246), 221 states have internal predecessors, (246), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-27 23:33:11,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 270 transitions. [2024-11-27 23:33:11,339 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 270 transitions. Word has length 123 [2024-11-27 23:33:11,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:33:11,340 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 270 transitions. [2024-11-27 23:33:11,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 69 states have (on average 1.9710144927536233) internal successors, (136), 66 states have internal predecessors, (136), 5 states have call successors, (9), 2 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-27 23:33:11,340 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 270 transitions. [2024-11-27 23:33:11,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-27 23:33:11,342 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:33:11,342 INFO L218 NwaCegarLoop]: trace histogram [42, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:33:11,372 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-27 23:33:11,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-27 23:33:11,542 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-27 23:33:11,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:33:11,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1822225499, now seen corresponding path program 1 times [2024-11-27 23:33:11,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:33:11,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912220127] [2024-11-27 23:33:11,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:33:11,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:33:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:33:14,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 514 proven. 280 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2024-11-27 23:33:14,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:33:14,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912220127] [2024-11-27 23:33:14,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912220127] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:33:14,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764306550] [2024-11-27 23:33:14,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:33:14,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:33:14,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:33:14,312 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:33:14,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-27 23:33:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:33:14,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 1266 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-11-27 23:33:14,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:33:15,436 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 23:33:15,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-27 23:33:16,180 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-27 23:33:16,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-11-27 23:33:16,572 WARN L851 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (= (select |c_#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|))))) (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_33| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_33| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_33| .cse0 (select |c_#valid| .cse0)))))) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|))))) is different from false [2024-11-27 23:33:16,867 WARN L873 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (= (select |c_#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|))))) (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_33| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_33| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_33| .cse0 (select |c_#valid| .cse0)))))) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|))))) is different from true [2024-11-27 23:33:16,900 WARN L851 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (= (select |c_#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|))))) (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_33| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_33| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_33| .cse0 (select |c_#valid| .cse0)))))) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|))))) is different from false [2024-11-27 23:33:17,039 WARN L873 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (= (select |c_#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|))))) (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_33| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_33| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_33| .cse0 (select |c_#valid| .cse0)))))) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|))))) is different from true [2024-11-27 23:33:17,137 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2024-11-27 23:33:17,231 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2024-11-27 23:33:17,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 22 [2024-11-27 23:33:17,248 WARN L851 $PredicateComparison]: unable to prove that (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (= (select |c_#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|))))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_33| |v_old(#valid)_AFTER_CALL_64|))) (and (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_33| .cse0 (select |v_old(#valid)_AFTER_CALL_64| .cse0))) (= (select |v_#valid_BEFORE_CALL_33| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0)))) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|))))))) is different from false [2024-11-27 23:33:17,251 WARN L873 $PredicateComparison]: unable to prove that (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (= (select |c_#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|))))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_33| |v_old(#valid)_AFTER_CALL_64|))) (and (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_33| .cse0 (select |v_old(#valid)_AFTER_CALL_64| .cse0))) (= (select |v_#valid_BEFORE_CALL_33| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0)))) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|))))))) is different from true [2024-11-27 23:33:17,303 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (= (select |c_#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|))))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_33| |v_old(#valid)_AFTER_CALL_64|))) (and (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_33| .cse0 (select |v_old(#valid)_AFTER_CALL_64| .cse0))) (= (select |v_#valid_BEFORE_CALL_33| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0)))) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|)))))))) is different from false [2024-11-27 23:33:17,307 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (= (select |c_#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|))))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_33| |v_old(#valid)_AFTER_CALL_64|))) (and (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_33| .cse0 (select |v_old(#valid)_AFTER_CALL_64| .cse0))) (= (select |v_#valid_BEFORE_CALL_33| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0)))) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|)))))))) is different from true [2024-11-27 23:33:17,629 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|ULTIMATE.start_l2_insert_~item~2#1.base| Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_33| |v_old(#valid)_AFTER_CALL_64|))) (and (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_33| .cse0 (select |v_old(#valid)_AFTER_CALL_64| .cse0))) (= (select |v_#valid_BEFORE_CALL_33| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|)) (= (select |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse0) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (= (select |c_#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|)))) (exists ((v_ArrVal_4790 Int)) (= (select |c_#valid| v_ArrVal_4790) 1)))) is different from false [2024-11-27 23:33:17,633 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|ULTIMATE.start_l2_insert_~item~2#1.base| Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_33| |v_old(#valid)_AFTER_CALL_64|))) (and (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_33| .cse0 (select |v_old(#valid)_AFTER_CALL_64| .cse0))) (= (select |v_#valid_BEFORE_CALL_33| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|)) (= (select |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse0) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (= (select |c_#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|)))) (exists ((v_ArrVal_4790 Int)) (= (select |c_#valid| v_ArrVal_4790) 1)))) is different from true [2024-11-27 23:33:18,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 482 proven. 444 refuted. 0 times theorem prover too weak. 190 trivial. 132 not checked. [2024-11-27 23:33:18,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:33:18,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764306550] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:33:18,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 23:33:18,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 35] total 45 [2024-11-27 23:33:18,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407450375] [2024-11-27 23:33:18,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 23:33:18,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-27 23:33:18,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:33:18,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-27 23:33:18,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1528, Unknown=11, NotChecked=510, Total=2256 [2024-11-27 23:33:18,286 INFO L87 Difference]: Start difference. First operand 237 states and 270 transitions. Second operand has 46 states, 42 states have (on average 2.6666666666666665) internal successors, (112), 37 states have internal predecessors, (112), 7 states have call successors, (9), 2 states have call predecessors, (9), 7 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-27 23:33:19,324 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~item~3#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|)) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|)) .cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (or (and .cse0 (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (= (select |c_#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|))))) (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_33| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_33| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_33| .cse1 (select |c_#valid| .cse1)))))) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|))))) (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (not (= |ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|)) (= (select |c_#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|)))))) is different from false [2024-11-27 23:33:19,328 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~item~3#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|)) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|)) .cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (or (and .cse0 (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (= (select |c_#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|))))) (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_33| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_33| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_33| .cse1 (select |c_#valid| .cse1)))))) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|))))) (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (not (= |ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|)) (= (select |c_#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|)))))) is different from true [2024-11-27 23:33:19,333 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0 (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|)) (or (and .cse0 (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (= (select |c_#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|))))) (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_33| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_33| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_33| .cse1 (select |c_#valid| .cse1)))))) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|))))))) is different from false [2024-11-27 23:33:19,336 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0 (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|)) (or (and .cse0 (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (= (select |c_#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|))))) (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_33| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_33| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_33| .cse1 (select |c_#valid| .cse1)))))) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|))))))) is different from true [2024-11-27 23:33:19,342 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0 (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|)) (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (= (select |c_#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|))))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_33| |v_old(#valid)_AFTER_CALL_64|))) (and (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_33| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1))) (= (select |v_#valid_BEFORE_CALL_33| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1)))) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|))))))))) is different from false [2024-11-27 23:33:19,346 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0 (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|)) (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (= (select |c_#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|))))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_33| |v_old(#valid)_AFTER_CALL_64|))) (and (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_33| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1))) (= (select |v_#valid_BEFORE_CALL_33| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1)))) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|))))))))) is different from true [2024-11-27 23:33:19,351 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (= (select |c_#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|))))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_33| |v_old(#valid)_AFTER_CALL_64|))) (and (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_33| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1))) (= (select |v_#valid_BEFORE_CALL_33| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1)))) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|))))))) (or (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0 (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|)))) is different from false [2024-11-27 23:33:19,354 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (= (select |c_#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|))))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_33| |v_old(#valid)_AFTER_CALL_64|))) (and (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_33| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1))) (= (select |v_#valid_BEFORE_CALL_33| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1)))) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|))))))) (or (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0 (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|)))) is different from true [2024-11-27 23:33:19,360 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0 (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|)) (or (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|ULTIMATE.start_l2_insert_~item~2#1.base| Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_33| |v_old(#valid)_AFTER_CALL_64|))) (and (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_33| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1))) (= (select |v_#valid_BEFORE_CALL_33| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|)) (= (select |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse1) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (= (select |c_#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|)))) (exists ((v_ArrVal_4790 Int)) (= (select |c_#valid| v_ArrVal_4790) 1)))))) is different from false [2024-11-27 23:33:19,364 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0 (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|)) (or (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|ULTIMATE.start_l2_insert_~item~2#1.base| Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_33| |v_old(#valid)_AFTER_CALL_64|))) (and (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_33| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1))) (= (select |v_#valid_BEFORE_CALL_33| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|)) (= (select |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse1) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (= (select |c_#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|)))) (exists ((v_ArrVal_4790 Int)) (= (select |c_#valid| v_ArrVal_4790) 1)))))) is different from true [2024-11-27 23:33:19,379 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0) (or (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|ULTIMATE.start_l2_insert_~item~2#1.base| Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_33| |v_old(#valid)_AFTER_CALL_64|))) (and (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_33| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1))) (= (select |v_#valid_BEFORE_CALL_33| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|)) (= (select |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse1) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (= (select |c_#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|)))) (exists ((v_ArrVal_4790 Int)) (= (select |c_#valid| v_ArrVal_4790) 1)))))) is different from false [2024-11-27 23:33:19,382 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0) (or (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|ULTIMATE.start_l2_insert_~item~2#1.base| Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_33| |v_old(#valid)_AFTER_CALL_64|))) (and (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_33| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1))) (= (select |v_#valid_BEFORE_CALL_33| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|)) (= (select |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse1) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (= (select |c_#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|)))) (exists ((v_ArrVal_4790 Int)) (= (select |c_#valid| v_ArrVal_4790) 1)))))) is different from true [2024-11-27 23:33:19,392 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and .cse0 (or (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|ULTIMATE.start_l2_insert_~item~2#1.base| Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_33| |v_old(#valid)_AFTER_CALL_64|))) (and (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_33| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1))) (= (select |v_#valid_BEFORE_CALL_33| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|)) (= (select |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse1) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (= (select |c_#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|)))) (exists ((v_ArrVal_4790 Int)) (= (select |c_#valid| v_ArrVal_4790) 1)))))) is different from false [2024-11-27 23:33:19,395 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and .cse0 (or (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|ULTIMATE.start_l2_insert_~item~2#1.base| Int) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_33| |v_old(#valid)_AFTER_CALL_64|))) (and (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_33| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1))) (= (select |v_#valid_BEFORE_CALL_33| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|)) (= (select |v_#valid_BEFORE_CALL_33| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse1) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (and (= (select |c_#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |ULTIMATE.start_l2_insert_~item~2#1.base|)))) (exists ((v_ArrVal_4790 Int)) (= (select |c_#valid| v_ArrVal_4790) 1)))))) is different from true [2024-11-27 23:33:22,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:33:22,097 INFO L93 Difference]: Finished difference Result 366 states and 427 transitions. [2024-11-27 23:33:22,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-27 23:33:22,097 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 2.6666666666666665) internal successors, (112), 37 states have internal predecessors, (112), 7 states have call successors, (9), 2 states have call predecessors, (9), 7 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) Word has length 129 [2024-11-27 23:33:22,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:33:22,101 INFO L225 Difference]: With dead ends: 366 [2024-11-27 23:33:22,101 INFO L226 Difference]: Without dead ends: 366 [2024-11-27 23:33:22,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 136 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=318, Invalid=1965, Unknown=25, NotChecked=1352, Total=3660 [2024-11-27 23:33:22,103 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 802 mSDsluCounter, 3468 mSDsCounter, 0 mSdLazyCounter, 2506 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 3662 SdHoareTripleChecker+Invalid, 5780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 2506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3177 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-27 23:33:22,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 3662 Invalid, 5780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 2506 Invalid, 0 Unknown, 3177 Unchecked, 3.3s Time] [2024-11-27 23:33:22,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-27 23:33:22,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 265. [2024-11-27 23:33:22,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 177 states have (on average 1.5480225988700564) internal successors, (274), 245 states have internal predecessors, (274), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-27 23:33:22,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 306 transitions. [2024-11-27 23:33:22,114 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 306 transitions. Word has length 129 [2024-11-27 23:33:22,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:33:22,115 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 306 transitions. [2024-11-27 23:33:22,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 2.6666666666666665) internal successors, (112), 37 states have internal predecessors, (112), 7 states have call successors, (9), 2 states have call predecessors, (9), 7 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-27 23:33:22,116 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 306 transitions. [2024-11-27 23:33:22,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-27 23:33:22,117 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:33:22,117 INFO L218 NwaCegarLoop]: trace histogram [42, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:33:22,133 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-27 23:33:22,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-27 23:33:22,318 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-27 23:33:22,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:33:22,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1822225498, now seen corresponding path program 1 times [2024-11-27 23:33:22,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:33:22,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48945332] [2024-11-27 23:33:22,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:33:22,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:33:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:33:31,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 478 proven. 616 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2024-11-27 23:33:31,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:33:31,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48945332] [2024-11-27 23:33:31,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48945332] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:33:31,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814981812] [2024-11-27 23:33:31,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:33:31,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:33:31,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:33:31,819 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:33:31,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-27 23:33:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:33:33,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 1266 conjuncts, 170 conjuncts are in the unsatisfiable core [2024-11-27 23:33:33,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:33:34,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-27 23:33:38,258 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= |c_#valid| (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|))) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2024-11-27 23:33:39,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:33:39,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-11-27 23:33:40,016 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-27 23:33:40,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-27 23:33:41,181 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 23:33:41,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-27 23:33:41,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-11-27 23:33:42,172 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-11-27 23:33:42,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2024-11-27 23:33:42,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-11-27 23:33:42,872 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2024-11-27 23:33:42,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:33:42,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-27 23:33:42,978 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-27 23:33:42,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2024-11-27 23:33:43,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 97 proven. 715 refuted. 0 times theorem prover too weak. 171 trivial. 265 not checked. [2024-11-27 23:33:43,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:33:44,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814981812] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:33:44,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 23:33:44,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 49] total 86 [2024-11-27 23:33:44,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926631087] [2024-11-27 23:33:44,095 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 23:33:44,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2024-11-27 23:33:44,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:33:44,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2024-11-27 23:33:44,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=7164, Unknown=2, NotChecked=342, Total=7832 [2024-11-27 23:33:44,100 INFO L87 Difference]: Start difference. First operand 265 states and 306 transitions. Second operand has 87 states, 82 states have (on average 2.0) internal successors, (164), 79 states have internal predecessors, (164), 7 states have call successors, (9), 2 states have call predecessors, (9), 9 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-27 23:33:48,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-27 23:34:00,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-27 23:34:04,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-27 23:34:18,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:34:18,302 INFO L93 Difference]: Finished difference Result 369 states and 433 transitions. [2024-11-27 23:34:18,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-27 23:34:18,302 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 82 states have (on average 2.0) internal successors, (164), 79 states have internal predecessors, (164), 7 states have call successors, (9), 2 states have call predecessors, (9), 9 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) Word has length 129 [2024-11-27 23:34:18,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:34:18,305 INFO L225 Difference]: With dead ends: 369 [2024-11-27 23:34:18,305 INFO L226 Difference]: Without dead ends: 369 [2024-11-27 23:34:18,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 114 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2971 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=712, Invalid=12176, Unknown=2, NotChecked=450, Total=13340 [2024-11-27 23:34:18,311 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 511 mSDsluCounter, 2220 mSDsCounter, 0 mSdLazyCounter, 10993 mSolverCounterSat, 47 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 2305 SdHoareTripleChecker+Invalid, 11757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 10993 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 715 IncrementalHoareTripleChecker+Unchecked, 28.5s IncrementalHoareTripleChecker+Time [2024-11-27 23:34:18,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 2305 Invalid, 11757 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [47 Valid, 10993 Invalid, 2 Unknown, 715 Unchecked, 28.5s Time] [2024-11-27 23:34:18,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-27 23:34:18,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 231. [2024-11-27 23:34:18,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 153 states have (on average 1.5686274509803921) internal successors, (240), 215 states have internal predecessors, (240), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-27 23:34:18,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 264 transitions. [2024-11-27 23:34:18,325 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 264 transitions. Word has length 129 [2024-11-27 23:34:18,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:34:18,325 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 264 transitions. [2024-11-27 23:34:18,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 82 states have (on average 2.0) internal successors, (164), 79 states have internal predecessors, (164), 7 states have call successors, (9), 2 states have call predecessors, (9), 9 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-27 23:34:18,326 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 264 transitions. [2024-11-27 23:34:18,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-27 23:34:18,327 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:34:18,327 INFO L218 NwaCegarLoop]: trace histogram [42, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:34:18,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-27 23:34:18,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-27 23:34:18,528 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-27 23:34:18,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:18,529 INFO L85 PathProgramCache]: Analyzing trace with hash 641070129, now seen corresponding path program 1 times [2024-11-27 23:34:18,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:18,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155411691] [2024-11-27 23:34:18,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:18,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:21,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 155 proven. 372 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2024-11-27 23:34:21,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:21,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155411691] [2024-11-27 23:34:21,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155411691] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:34:21,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596430371] [2024-11-27 23:34:21,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:21,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:34:21,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:34:21,716 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:34:21,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-27 23:34:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:22,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 1311 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-11-27 23:34:22,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:34:22,513 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|))) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2024-11-27 23:34:22,669 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-27 23:34:22,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-27 23:34:22,845 WARN L851 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_47| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_47| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l2_insert_#t~ret12#1.base|) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))) is different from false [2024-11-27 23:34:22,848 WARN L873 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_47| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_47| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l2_insert_#t~ret12#1.base|) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))) is different from true [2024-11-27 23:34:22,875 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_47| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_47| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l2_insert_~item~2#1.base|) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)) is different from false [2024-11-27 23:34:22,878 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_47| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_47| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l2_insert_~item~2#1.base|) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)) is different from true [2024-11-27 23:34:22,899 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_47| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_47| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)) is different from false [2024-11-27 23:34:22,903 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_47| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_47| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)) is different from true [2024-11-27 23:34:23,106 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_47| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_47| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse1 (select |c_#valid| .cse1))) (= |c_ULTIMATE.start_l3_insert_#t~ret9#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse2 (select |v_#valid_BEFORE_CALL_49| .cse2))))))))) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse3 (select |c_#valid| .cse3))) (= |c_ULTIMATE.start_l3_insert_#t~ret9#1.base| .cse3))))) is different from false [2024-11-27 23:34:23,112 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_47| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_47| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse1 (select |c_#valid| .cse1))) (= |c_ULTIMATE.start_l3_insert_#t~ret9#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse2 (select |v_#valid_BEFORE_CALL_49| .cse2))))))))) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse3 (select |c_#valid| .cse3))) (= |c_ULTIMATE.start_l3_insert_#t~ret9#1.base| .cse3))))) is different from true [2024-11-27 23:34:23,219 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_47| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_47| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l3_insert_~item~1#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse3 (select |v_#valid_BEFORE_CALL_49| .cse3))))))))) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)) is different from false [2024-11-27 23:34:23,225 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_47| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_47| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l3_insert_~item~1#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse3 (select |v_#valid_BEFORE_CALL_49| .cse3))))))))) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)) is different from true [2024-11-27 23:34:23,304 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_47| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_47| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse2 (select |v_#valid_BEFORE_CALL_49| .cse2))))))))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse3 (select |c_#valid| .cse3))) (= .cse3 |c_ULTIMATE.start_l4_insert_~list#1.base|))))) is different from false [2024-11-27 23:34:23,310 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_47| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_47| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse2 (select |v_#valid_BEFORE_CALL_49| .cse2))))))))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse3 (select |c_#valid| .cse3))) (= .cse3 |c_ULTIMATE.start_l4_insert_~list#1.base|))))) is different from true [2024-11-27 23:34:27,591 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_47| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_47| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_75| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_75| .cse1 (select |c_#valid| .cse1))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_49| .cse2 (select |v_old(#valid)_AFTER_CALL_75| .cse2)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))))) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_75| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse3 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_75| .cse3 (select |c_#valid| .cse3)))))) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_75| |c_#valid|))) (and (= .cse4 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= .cse5 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_49| .cse5 (select |v_old(#valid)_AFTER_CALL_75| .cse5)) |v_old(#valid)_AFTER_CALL_75|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse6) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse6 (select |v_#valid_BEFORE_CALL_49| .cse6))))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_75| .cse4 (select |c_#valid| .cse4)))))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse7 (select |c_#valid| .cse7))) (= .cse7 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse8) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse8 (select |v_#valid_BEFORE_CALL_49| .cse8))))))))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse9 (select |c_#valid| .cse9))) (= .cse9 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_75| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse10 (select |v_old(#valid)_AFTER_CALL_75| .cse10)) |v_old(#valid)_AFTER_CALL_75|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse10) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= .cse11 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_75| .cse11 (select |c_#valid| .cse11))))))) is different from false [2024-11-27 23:34:27,606 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_47| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_47| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_75| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_75| .cse1 (select |c_#valid| .cse1))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_49| .cse2 (select |v_old(#valid)_AFTER_CALL_75| .cse2)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))))) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_75| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse3 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_75| .cse3 (select |c_#valid| .cse3)))))) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_75| |c_#valid|))) (and (= .cse4 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= .cse5 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_49| .cse5 (select |v_old(#valid)_AFTER_CALL_75| .cse5)) |v_old(#valid)_AFTER_CALL_75|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse6) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse6 (select |v_#valid_BEFORE_CALL_49| .cse6))))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_75| .cse4 (select |c_#valid| .cse4)))))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse7 (select |c_#valid| .cse7))) (= .cse7 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse8) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse8 (select |v_#valid_BEFORE_CALL_49| .cse8))))))))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse9 (select |c_#valid| .cse9))) (= .cse9 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_75| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse10 (select |v_old(#valid)_AFTER_CALL_75| .cse10)) |v_old(#valid)_AFTER_CALL_75|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse10) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= .cse11 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_75| .cse11 (select |c_#valid| .cse11))))))) is different from true [2024-11-27 23:34:31,802 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_47| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_47| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_75| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_49| .cse1 (select |v_old(#valid)_AFTER_CALL_75| .cse1)) |v_old(#valid)_AFTER_CALL_75|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse2 (select |v_#valid_BEFORE_CALL_49| .cse2))))))))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_75| .cse3 (select |c_#valid| .cse3)))))) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_75| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse4 (select |v_old(#valid)_AFTER_CALL_75| .cse4)) |v_old(#valid)_AFTER_CALL_75|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse4) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse5) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_75| .cse5 (select |c_#valid| .cse5)))))) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_75| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse6) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_75| .cse6 (select |c_#valid| .cse6)))))) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_75| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse7) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_75| .cse7 (select |c_#valid| .cse7))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= .cse8 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_49| .cse8 (select |v_old(#valid)_AFTER_CALL_75| .cse8)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))))) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse9 (select |c_#valid| .cse9))) (= .cse9 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse10) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse10 (select |v_#valid_BEFORE_CALL_49| .cse10))))))))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse11 (select |c_#valid| .cse11))) (= .cse11 |c_ULTIMATE.start_l4_insert_~list#1.base|))))) is different from false [2024-11-27 23:34:31,817 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_47| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_47| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_75| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_49| .cse1 (select |v_old(#valid)_AFTER_CALL_75| .cse1)) |v_old(#valid)_AFTER_CALL_75|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse2 (select |v_#valid_BEFORE_CALL_49| .cse2))))))))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_75| .cse3 (select |c_#valid| .cse3)))))) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_75| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse4 (select |v_old(#valid)_AFTER_CALL_75| .cse4)) |v_old(#valid)_AFTER_CALL_75|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse4) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse5) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_75| .cse5 (select |c_#valid| .cse5)))))) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_75| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse6) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_75| .cse6 (select |c_#valid| .cse6)))))) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_75| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse7) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_75| .cse7 (select |c_#valid| .cse7))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= .cse8 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_49| .cse8 (select |v_old(#valid)_AFTER_CALL_75| .cse8)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))))) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse9 (select |c_#valid| .cse9))) (= .cse9 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse10) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse10 (select |v_#valid_BEFORE_CALL_49| .cse10))))))))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse11 (select |c_#valid| .cse11))) (= .cse11 |c_ULTIMATE.start_l4_insert_~list#1.base|))))) is different from true [2024-11-27 23:34:31,900 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2024-11-27 23:34:31,979 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-27 23:34:31,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-27 23:34:36,171 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_old(#valid)_AFTER_CALL_75| .cse0 (select |v_old(#valid)_AFTER_CALL_76| .cse0)) |v_old(#valid)_AFTER_CALL_76|) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_49| .cse1 (select |v_old(#valid)_AFTER_CALL_75| .cse1)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse2 (select |v_old(#valid)_AFTER_CALL_75| .cse2)) |v_old(#valid)_AFTER_CALL_75|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_75| .cse3 (select |v_old(#valid)_AFTER_CALL_76| .cse3)) |v_old(#valid)_AFTER_CALL_76|)))))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse4 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse4 (select |v_old(#valid)_AFTER_CALL_76| .cse4)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse5) (= (store |v_old(#valid)_AFTER_CALL_75| .cse5 (select |v_old(#valid)_AFTER_CALL_76| .cse5)) |v_old(#valid)_AFTER_CALL_76|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_76|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse6 (select |v_old(#valid)_AFTER_CALL_76| .cse6)) |v_old(#valid)_AFTER_CALL_76|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse6) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse7) (= (store |v_old(#valid)_AFTER_CALL_75| .cse7 (select |v_old(#valid)_AFTER_CALL_76| .cse7)) |v_old(#valid)_AFTER_CALL_76|) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= .cse8 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_49| .cse8 (select |v_old(#valid)_AFTER_CALL_75| .cse8)) |v_old(#valid)_AFTER_CALL_75|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse9) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse9 (select |v_#valid_BEFORE_CALL_49| .cse9)))))))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= .cse10 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse11) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse11 (select |v_#valid_BEFORE_CALL_49| .cse11)))))) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse10 (select |v_old(#valid)_AFTER_CALL_76| .cse10)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) is different from false [2024-11-27 23:34:36,182 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_old(#valid)_AFTER_CALL_75| .cse0 (select |v_old(#valid)_AFTER_CALL_76| .cse0)) |v_old(#valid)_AFTER_CALL_76|) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_49| .cse1 (select |v_old(#valid)_AFTER_CALL_75| .cse1)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse2 (select |v_old(#valid)_AFTER_CALL_75| .cse2)) |v_old(#valid)_AFTER_CALL_75|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_75| .cse3 (select |v_old(#valid)_AFTER_CALL_76| .cse3)) |v_old(#valid)_AFTER_CALL_76|)))))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse4 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse4 (select |v_old(#valid)_AFTER_CALL_76| .cse4)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse5) (= (store |v_old(#valid)_AFTER_CALL_75| .cse5 (select |v_old(#valid)_AFTER_CALL_76| .cse5)) |v_old(#valid)_AFTER_CALL_76|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_76|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse6 (select |v_old(#valid)_AFTER_CALL_76| .cse6)) |v_old(#valid)_AFTER_CALL_76|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse6) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse7) (= (store |v_old(#valid)_AFTER_CALL_75| .cse7 (select |v_old(#valid)_AFTER_CALL_76| .cse7)) |v_old(#valid)_AFTER_CALL_76|) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= .cse8 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_49| .cse8 (select |v_old(#valid)_AFTER_CALL_75| .cse8)) |v_old(#valid)_AFTER_CALL_75|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse9) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse9 (select |v_#valid_BEFORE_CALL_49| .cse9)))))))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= .cse10 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse11) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse11 (select |v_#valid_BEFORE_CALL_49| .cse11)))))) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse10 (select |v_old(#valid)_AFTER_CALL_76| .cse10)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) is different from true [2024-11-27 23:34:40,440 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_old(#valid)_AFTER_CALL_75| .cse0 (select |v_old(#valid)_AFTER_CALL_76| .cse0)) |v_old(#valid)_AFTER_CALL_76|) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_49| .cse1 (select |v_old(#valid)_AFTER_CALL_75| .cse1)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse2 (select |v_old(#valid)_AFTER_CALL_75| .cse2)) |v_old(#valid)_AFTER_CALL_75|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_75| .cse3 (select |v_old(#valid)_AFTER_CALL_76| .cse3)) |v_old(#valid)_AFTER_CALL_76|)))))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse4 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse4 (select |v_old(#valid)_AFTER_CALL_76| .cse4)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse5) (= (store |v_old(#valid)_AFTER_CALL_75| .cse5 (select |v_old(#valid)_AFTER_CALL_76| .cse5)) |v_old(#valid)_AFTER_CALL_76|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_76|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse6 (select |v_old(#valid)_AFTER_CALL_76| .cse6)) |v_old(#valid)_AFTER_CALL_76|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse6) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse7) (= (store |v_old(#valid)_AFTER_CALL_75| .cse7 (select |v_old(#valid)_AFTER_CALL_76| .cse7)) |v_old(#valid)_AFTER_CALL_76|) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= .cse8 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_49| .cse8 (select |v_old(#valid)_AFTER_CALL_75| .cse8)) |v_old(#valid)_AFTER_CALL_75|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse9) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse9 (select |v_#valid_BEFORE_CALL_49| .cse9)))))))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= .cse10 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse11) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse11 (select |v_#valid_BEFORE_CALL_49| .cse11)))))) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse10 (select |v_old(#valid)_AFTER_CALL_76| .cse10)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) is different from false [2024-11-27 23:34:40,450 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_old(#valid)_AFTER_CALL_75| .cse0 (select |v_old(#valid)_AFTER_CALL_76| .cse0)) |v_old(#valid)_AFTER_CALL_76|) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_49| .cse1 (select |v_old(#valid)_AFTER_CALL_75| .cse1)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse2 (select |v_old(#valid)_AFTER_CALL_75| .cse2)) |v_old(#valid)_AFTER_CALL_75|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_75| .cse3 (select |v_old(#valid)_AFTER_CALL_76| .cse3)) |v_old(#valid)_AFTER_CALL_76|)))))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse4 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse4 (select |v_old(#valid)_AFTER_CALL_76| .cse4)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse5) (= (store |v_old(#valid)_AFTER_CALL_75| .cse5 (select |v_old(#valid)_AFTER_CALL_76| .cse5)) |v_old(#valid)_AFTER_CALL_76|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_76|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse6 (select |v_old(#valid)_AFTER_CALL_76| .cse6)) |v_old(#valid)_AFTER_CALL_76|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse6) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse7) (= (store |v_old(#valid)_AFTER_CALL_75| .cse7 (select |v_old(#valid)_AFTER_CALL_76| .cse7)) |v_old(#valid)_AFTER_CALL_76|) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= .cse8 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_49| .cse8 (select |v_old(#valid)_AFTER_CALL_75| .cse8)) |v_old(#valid)_AFTER_CALL_75|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse9) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse9 (select |v_#valid_BEFORE_CALL_49| .cse9)))))))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= .cse10 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse11) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse11 (select |v_#valid_BEFORE_CALL_49| .cse11)))))) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse10 (select |v_old(#valid)_AFTER_CALL_76| .cse10)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) is different from true [2024-11-27 23:34:44,964 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (let ((.cse6 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse0 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|)) (.cse1 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse0) (= (store |v_#valid_BEFORE_CALL_49| .cse1 (select |v_old(#valid)_AFTER_CALL_75| .cse1)) |v_old(#valid)_AFTER_CALL_75|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= (store |v_old(#valid)_AFTER_CALL_75| .cse2 (select |v_old(#valid)_AFTER_CALL_76| .cse2)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse0 (select |v_#valid_BEFORE_CALL_49| .cse0))) (= (select |c_#valid| .cse1) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= (select |c_#valid| .cse4) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse4 (select |v_old(#valid)_AFTER_CALL_76| .cse4))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse3 (select |v_#valid_BEFORE_CALL_49| .cse3)))))) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_76|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse5 (select |v_old(#valid)_AFTER_CALL_76| .cse5)) |v_old(#valid)_AFTER_CALL_76|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse5) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) .cse6) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse7 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_49| .cse7 (select |v_old(#valid)_AFTER_CALL_75| .cse7)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse8) (= (store |v_old(#valid)_AFTER_CALL_75| .cse8 (select |v_old(#valid)_AFTER_CALL_76| .cse8)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse7) 1)))) (and .cse6 (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse9) (= (store |v_old(#valid)_AFTER_CALL_75| .cse9 (select |v_old(#valid)_AFTER_CALL_76| .cse9)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse10) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse10 (select |v_old(#valid)_AFTER_CALL_76| .cse10))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) .cse6) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|)) (.cse12 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse11 (select |v_old(#valid)_AFTER_CALL_75| .cse11)) |v_old(#valid)_AFTER_CALL_75|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse11) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse12) (= (store |v_old(#valid)_AFTER_CALL_75| .cse12 (select |v_old(#valid)_AFTER_CALL_76| .cse12)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) .cse6)))) is different from false [2024-11-27 23:34:44,973 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (let ((.cse6 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse0 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|)) (.cse1 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse0) (= (store |v_#valid_BEFORE_CALL_49| .cse1 (select |v_old(#valid)_AFTER_CALL_75| .cse1)) |v_old(#valid)_AFTER_CALL_75|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= (store |v_old(#valid)_AFTER_CALL_75| .cse2 (select |v_old(#valid)_AFTER_CALL_76| .cse2)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse0 (select |v_#valid_BEFORE_CALL_49| .cse0))) (= (select |c_#valid| .cse1) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= (select |c_#valid| .cse4) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse4 (select |v_old(#valid)_AFTER_CALL_76| .cse4))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse3 (select |v_#valid_BEFORE_CALL_49| .cse3)))))) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_76|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse5 (select |v_old(#valid)_AFTER_CALL_76| .cse5)) |v_old(#valid)_AFTER_CALL_76|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse5) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) .cse6) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse7 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_49| .cse7 (select |v_old(#valid)_AFTER_CALL_75| .cse7)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse8) (= (store |v_old(#valid)_AFTER_CALL_75| .cse8 (select |v_old(#valid)_AFTER_CALL_76| .cse8)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse7) 1)))) (and .cse6 (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse9) (= (store |v_old(#valid)_AFTER_CALL_75| .cse9 (select |v_old(#valid)_AFTER_CALL_76| .cse9)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse10) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse10 (select |v_old(#valid)_AFTER_CALL_76| .cse10))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) .cse6) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|)) (.cse12 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse11 (select |v_old(#valid)_AFTER_CALL_75| .cse11)) |v_old(#valid)_AFTER_CALL_75|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse11) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse12) (= (store |v_old(#valid)_AFTER_CALL_75| .cse12 (select |v_old(#valid)_AFTER_CALL_76| .cse12)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) .cse6)))) is different from true [2024-11-27 23:34:49,801 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse3 (exists ((v_ArrVal_6011 Int)) (= (select |c_#valid| v_ArrVal_6011) 1)))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse0) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse0 (select |v_old(#valid)_AFTER_CALL_76| .cse0)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse1) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse2 (select |v_old(#valid)_AFTER_CALL_76| .cse2))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse3) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|)) (.cse4 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse4) (= (select |c_#valid| .cse5) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse5 (select |v_old(#valid)_AFTER_CALL_76| .cse5))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse4 (select |v_#valid_BEFORE_CALL_49| .cse4)))))) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse6 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|)) (.cse7 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse6) (= (store |v_#valid_BEFORE_CALL_49| .cse7 (select |v_old(#valid)_AFTER_CALL_75| .cse7)) |v_old(#valid)_AFTER_CALL_75|) (= (select |c_#valid| .cse8) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse8 (select |v_old(#valid)_AFTER_CALL_76| .cse8)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse6 (select |v_#valid_BEFORE_CALL_49| .cse6))) (= (select |c_#valid| .cse7) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) .cse1 .cse3) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|)) (.cse10 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse9 (select |v_old(#valid)_AFTER_CALL_75| .cse9)) |v_old(#valid)_AFTER_CALL_75|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse9) (= (select |c_#valid| .cse10) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse10 (select |v_old(#valid)_AFTER_CALL_76| .cse10)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_76|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse11 (select |v_old(#valid)_AFTER_CALL_76| .cse11)) |v_old(#valid)_AFTER_CALL_76|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse11) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) .cse1 .cse3) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse12 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_49| .cse12 (select |v_old(#valid)_AFTER_CALL_75| .cse12)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse13) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse13 (select |v_old(#valid)_AFTER_CALL_76| .cse13)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse12) 1)))))) is different from false [2024-11-27 23:34:49,813 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse3 (exists ((v_ArrVal_6011 Int)) (= (select |c_#valid| v_ArrVal_6011) 1)))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse0) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse0 (select |v_old(#valid)_AFTER_CALL_76| .cse0)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse1) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse2 (select |v_old(#valid)_AFTER_CALL_76| .cse2))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse3) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|)) (.cse4 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse4) (= (select |c_#valid| .cse5) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse5 (select |v_old(#valid)_AFTER_CALL_76| .cse5))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse4 (select |v_#valid_BEFORE_CALL_49| .cse4)))))) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse6 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|)) (.cse7 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse6) (= (store |v_#valid_BEFORE_CALL_49| .cse7 (select |v_old(#valid)_AFTER_CALL_75| .cse7)) |v_old(#valid)_AFTER_CALL_75|) (= (select |c_#valid| .cse8) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse8 (select |v_old(#valid)_AFTER_CALL_76| .cse8)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse6 (select |v_#valid_BEFORE_CALL_49| .cse6))) (= (select |c_#valid| .cse7) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) .cse1 .cse3) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|)) (.cse10 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse9 (select |v_old(#valid)_AFTER_CALL_75| .cse9)) |v_old(#valid)_AFTER_CALL_75|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse9) (= (select |c_#valid| .cse10) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse10 (select |v_old(#valid)_AFTER_CALL_76| .cse10)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_76|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse11 (select |v_old(#valid)_AFTER_CALL_76| .cse11)) |v_old(#valid)_AFTER_CALL_76|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse11) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) .cse1 .cse3) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse12 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_49| .cse12 (select |v_old(#valid)_AFTER_CALL_75| .cse12)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse13) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse13 (select |v_old(#valid)_AFTER_CALL_76| .cse13)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse12) 1)))))) is different from true [2024-11-27 23:34:54,610 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (exists ((v_ArrVal_6011 Int)) (= (select |c_#valid| v_ArrVal_6011) 1))) (.cse5 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse8 (exists ((|ULTIMATE.start_l3_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse0 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|)) (.cse2 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= (store |v_#valid_BEFORE_CALL_49| .cse0 (select |v_old(#valid)_AFTER_CALL_75| .cse0)) |v_old(#valid)_AFTER_CALL_75|) (= (select |c_#valid| .cse1) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse1 (select |v_old(#valid)_AFTER_CALL_76| .cse1)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse2 (select |v_#valid_BEFORE_CALL_49| .cse2))) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| .cse2) 1)))) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse3 (select |v_old(#valid)_AFTER_CALL_75| .cse3)) |v_old(#valid)_AFTER_CALL_75|) (= (select |c_#valid| .cse4) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse4 (select |v_old(#valid)_AFTER_CALL_76| .cse4)) |v_old(#valid)_AFTER_CALL_76|) (= (select |c_#valid| .cse3) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) .cse5) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse6) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse6 (select |v_old(#valid)_AFTER_CALL_76| .cse6))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse7 .cse8) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|)) (.cse10 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= (select |c_#valid| .cse9) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse9 (select |v_old(#valid)_AFTER_CALL_76| .cse9))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse10 (select |v_#valid_BEFORE_CALL_49| .cse10))) (= (select |c_#valid| .cse10) 1)))) .cse7) (and .cse8 (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse11 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_49| .cse11 (select |v_old(#valid)_AFTER_CALL_75| .cse11)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse12) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse12 (select |v_old(#valid)_AFTER_CALL_76| .cse12)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse11) 1))))) (and .cse5 .cse7 (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |c_#valid| .cse13) 1) (= (store |v_#valid_BEFORE_CALL_47| .cse13 (select |v_old(#valid)_AFTER_CALL_76| .cse13)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) .cse5 .cse7 .cse8) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse14) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse14 (select |v_old(#valid)_AFTER_CALL_76| .cse14)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse5 .cse8))) is different from false [2024-11-27 23:34:54,624 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (exists ((v_ArrVal_6011 Int)) (= (select |c_#valid| v_ArrVal_6011) 1))) (.cse5 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse8 (exists ((|ULTIMATE.start_l3_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse0 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|)) (.cse2 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= (store |v_#valid_BEFORE_CALL_49| .cse0 (select |v_old(#valid)_AFTER_CALL_75| .cse0)) |v_old(#valid)_AFTER_CALL_75|) (= (select |c_#valid| .cse1) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse1 (select |v_old(#valid)_AFTER_CALL_76| .cse1)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse2 (select |v_#valid_BEFORE_CALL_49| .cse2))) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| .cse2) 1)))) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse3 (select |v_old(#valid)_AFTER_CALL_75| .cse3)) |v_old(#valid)_AFTER_CALL_75|) (= (select |c_#valid| .cse4) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse4 (select |v_old(#valid)_AFTER_CALL_76| .cse4)) |v_old(#valid)_AFTER_CALL_76|) (= (select |c_#valid| .cse3) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) .cse5) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse6) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse6 (select |v_old(#valid)_AFTER_CALL_76| .cse6))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse7 .cse8) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|)) (.cse10 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= (select |c_#valid| .cse9) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse9 (select |v_old(#valid)_AFTER_CALL_76| .cse9))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse10 (select |v_#valid_BEFORE_CALL_49| .cse10))) (= (select |c_#valid| .cse10) 1)))) .cse7) (and .cse8 (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse11 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_49| .cse11 (select |v_old(#valid)_AFTER_CALL_75| .cse11)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse12) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse12 (select |v_old(#valid)_AFTER_CALL_76| .cse12)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse11) 1))))) (and .cse5 .cse7 (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |c_#valid| .cse13) 1) (= (store |v_#valid_BEFORE_CALL_47| .cse13 (select |v_old(#valid)_AFTER_CALL_76| .cse13)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) .cse5 .cse7 .cse8) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse14) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse14 (select |v_old(#valid)_AFTER_CALL_76| .cse14)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse5 .cse8))) is different from true [2024-11-27 23:34:57,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 5 proven. 268 refuted. 0 times theorem prover too weak. 457 trivial. 518 not checked. [2024-11-27 23:34:57,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:34:58,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596430371] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:34:58,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 23:34:58,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 30] total 42 [2024-11-27 23:34:58,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754819869] [2024-11-27 23:34:58,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 23:34:58,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-27 23:34:58,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:58,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-27 23:34:58,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=889, Unknown=28, NotChecked=1110, Total=2162 [2024-11-27 23:34:58,345 INFO L87 Difference]: Start difference. First operand 231 states and 264 transitions. Second operand has 43 states, 38 states have (on average 2.8421052631578947) internal successors, (108), 33 states have internal predecessors, (108), 9 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-27 23:34:59,236 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l0_insert_~item~4#1.base|) 1) .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_47| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_47| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l2_insert_#t~ret12#1.base|) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))))) is different from false [2024-11-27 23:34:59,243 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l0_insert_~item~4#1.base|) 1) .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_47| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_47| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l2_insert_#t~ret12#1.base|) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))))) is different from true [2024-11-27 23:34:59,248 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)) (or (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_47| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_47| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l2_insert_~item~2#1.base|) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) .cse0))) is different from false [2024-11-27 23:34:59,252 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)) (or (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_47| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_47| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l2_insert_~item~2#1.base|) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) .cse0))) is different from true [2024-11-27 23:34:59,257 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)) (or (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_47| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_47| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) .cse0))) is different from false [2024-11-27 23:34:59,261 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)) (or (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_47| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_47| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) .cse0))) is different from true [2024-11-27 23:34:59,284 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_l3_insert_#t~ret9#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)) (or (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_47| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_47| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse2 (select |c_#valid| .cse2))) (= |c_ULTIMATE.start_l3_insert_#t~ret9#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse3 (select |v_#valid_BEFORE_CALL_49| .cse3))))))))) .cse0 (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse4 (select |c_#valid| .cse4))) (= |c_ULTIMATE.start_l3_insert_#t~ret9#1.base| .cse4))))))) is different from false [2024-11-27 23:34:59,290 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_l3_insert_#t~ret9#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)) (or (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_47| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_47| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse2 (select |c_#valid| .cse2))) (= |c_ULTIMATE.start_l3_insert_#t~ret9#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse3 (select |v_#valid_BEFORE_CALL_49| .cse3))))))))) .cse0 (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse4 (select |c_#valid| .cse4))) (= |c_ULTIMATE.start_l3_insert_#t~ret9#1.base| .cse4))))))) is different from true [2024-11-27 23:34:59,324 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_47| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_47| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l3_insert_~item~1#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse3 (select |v_#valid_BEFORE_CALL_49| .cse3))))))))) .cse4) (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse4 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)))) is different from false [2024-11-27 23:34:59,330 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_47| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_47| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l3_insert_~item~1#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse3 (select |v_#valid_BEFORE_CALL_49| .cse3))))))))) .cse4) (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse4 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)))) is different from true [2024-11-27 23:34:59,384 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_47| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_47| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) .cse1 (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse3 (select |v_#valid_BEFORE_CALL_49| .cse3))))))))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse4 (select |c_#valid| .cse4))) (= .cse4 |c_ULTIMATE.start_l4_insert_~list#1.base|))))) (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse1 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)))) is different from false [2024-11-27 23:34:59,392 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_47| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_47| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) .cse1 (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse3 (select |v_#valid_BEFORE_CALL_49| .cse3))))))))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse4 (select |c_#valid| .cse4))) (= .cse4 |c_ULTIMATE.start_l4_insert_~list#1.base|))))) (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse1 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)))) is different from true [2024-11-27 23:35:03,402 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_47| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_47| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_75| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_75| .cse1 (select |c_#valid| .cse1))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_49| .cse2 (select |v_old(#valid)_AFTER_CALL_75| .cse2)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))))) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_75| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse3 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_75| .cse3 (select |c_#valid| .cse3)))))) .cse4 (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_75| |c_#valid|))) (and (= .cse5 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= .cse6 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_49| .cse6 (select |v_old(#valid)_AFTER_CALL_75| .cse6)) |v_old(#valid)_AFTER_CALL_75|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse7) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse7 (select |v_#valid_BEFORE_CALL_49| .cse7))))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_75| .cse5 (select |c_#valid| .cse5)))))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse8 (select |c_#valid| .cse8))) (= .cse8 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse9) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse9 (select |v_#valid_BEFORE_CALL_49| .cse9))))))))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse10 (select |c_#valid| .cse10))) (= .cse10 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_75| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse11 (select |v_old(#valid)_AFTER_CALL_75| .cse11)) |v_old(#valid)_AFTER_CALL_75|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse11) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= .cse12 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_75| .cse12 (select |c_#valid| .cse12))))))) (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse4 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)))) is different from false [2024-11-27 23:35:03,414 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_47| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_47| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_75| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_75| .cse1 (select |c_#valid| .cse1))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_49| .cse2 (select |v_old(#valid)_AFTER_CALL_75| .cse2)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))))) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_75| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse3 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_75| .cse3 (select |c_#valid| .cse3)))))) .cse4 (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_75| |c_#valid|))) (and (= .cse5 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= .cse6 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_49| .cse6 (select |v_old(#valid)_AFTER_CALL_75| .cse6)) |v_old(#valid)_AFTER_CALL_75|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse7) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse7 (select |v_#valid_BEFORE_CALL_49| .cse7))))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_75| .cse5 (select |c_#valid| .cse5)))))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse8 (select |c_#valid| .cse8))) (= .cse8 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse9) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse9 (select |v_#valid_BEFORE_CALL_49| .cse9))))))))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse10 (select |c_#valid| .cse10))) (= .cse10 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_75| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse11 (select |v_old(#valid)_AFTER_CALL_75| .cse11)) |v_old(#valid)_AFTER_CALL_75|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse11) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= .cse12 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_75| .cse12 (select |c_#valid| .cse12))))))) (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse4 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)))) is different from true [2024-11-27 23:35:07,422 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_47| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_47| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_75| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_49| .cse1 (select |v_old(#valid)_AFTER_CALL_75| .cse1)) |v_old(#valid)_AFTER_CALL_75|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse2 (select |v_#valid_BEFORE_CALL_49| .cse2))))))))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_75| .cse3 (select |c_#valid| .cse3)))))) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_75| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse4 (select |v_old(#valid)_AFTER_CALL_75| .cse4)) |v_old(#valid)_AFTER_CALL_75|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse4) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse5) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_75| .cse5 (select |c_#valid| .cse5)))))) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_75| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse6) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_75| .cse6 (select |c_#valid| .cse6)))))) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_75| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse7) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_75| .cse7 (select |c_#valid| .cse7))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= .cse8 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_49| .cse8 (select |v_old(#valid)_AFTER_CALL_75| .cse8)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))))) .cse9 (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse10 (select |c_#valid| .cse10))) (= .cse10 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse11) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse11 (select |v_#valid_BEFORE_CALL_49| .cse11))))))))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse12 (select |c_#valid| .cse12))) (= .cse12 |c_ULTIMATE.start_l4_insert_~list#1.base|))))) (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse9 (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)))) is different from false [2024-11-27 23:35:07,435 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_47| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_47| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_75| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_49| .cse1 (select |v_old(#valid)_AFTER_CALL_75| .cse1)) |v_old(#valid)_AFTER_CALL_75|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse2 (select |v_#valid_BEFORE_CALL_49| .cse2))))))))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_75| .cse3 (select |c_#valid| .cse3)))))) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_75| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse4 (select |v_old(#valid)_AFTER_CALL_75| .cse4)) |v_old(#valid)_AFTER_CALL_75|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse4) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse5) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_75| .cse5 (select |c_#valid| .cse5)))))) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_75| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse6) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_75| .cse6 (select |c_#valid| .cse6)))))) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_75| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse7) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_75| .cse7 (select |c_#valid| .cse7))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= .cse8 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_49| .cse8 (select |v_old(#valid)_AFTER_CALL_75| .cse8)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))))) .cse9 (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse10 (select |c_#valid| .cse10))) (= .cse10 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse11) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse11 (select |v_#valid_BEFORE_CALL_49| .cse11))))))))) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_49| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_49| .cse12 (select |c_#valid| .cse12))) (= .cse12 |c_ULTIMATE.start_l4_insert_~list#1.base|))))) (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse9 (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)))) is different from true [2024-11-27 23:35:11,446 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_old(#valid)_AFTER_CALL_75| .cse0 (select |v_old(#valid)_AFTER_CALL_76| .cse0)) |v_old(#valid)_AFTER_CALL_76|) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_49| .cse1 (select |v_old(#valid)_AFTER_CALL_75| .cse1)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse2 (select |v_old(#valid)_AFTER_CALL_75| .cse2)) |v_old(#valid)_AFTER_CALL_75|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_75| .cse3 (select |v_old(#valid)_AFTER_CALL_76| .cse3)) |v_old(#valid)_AFTER_CALL_76|)))))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse4 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse4 (select |v_old(#valid)_AFTER_CALL_76| .cse4)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse5) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse6) (= (store |v_old(#valid)_AFTER_CALL_75| .cse6 (select |v_old(#valid)_AFTER_CALL_76| .cse6)) |v_old(#valid)_AFTER_CALL_76|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_76|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse7 (select |v_old(#valid)_AFTER_CALL_76| .cse7)) |v_old(#valid)_AFTER_CALL_76|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse7) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse8) (= (store |v_old(#valid)_AFTER_CALL_75| .cse8 (select |v_old(#valid)_AFTER_CALL_76| .cse8)) |v_old(#valid)_AFTER_CALL_76|) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= .cse9 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_49| .cse9 (select |v_old(#valid)_AFTER_CALL_75| .cse9)) |v_old(#valid)_AFTER_CALL_75|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse10) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse10 (select |v_#valid_BEFORE_CALL_49| .cse10)))))))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= .cse11 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse12) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse12 (select |v_#valid_BEFORE_CALL_49| .cse12)))))) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse11 (select |v_old(#valid)_AFTER_CALL_76| .cse11)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse5 (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)))) is different from false [2024-11-27 23:35:11,458 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_old(#valid)_AFTER_CALL_75| .cse0 (select |v_old(#valid)_AFTER_CALL_76| .cse0)) |v_old(#valid)_AFTER_CALL_76|) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_49| .cse1 (select |v_old(#valid)_AFTER_CALL_75| .cse1)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse2 (select |v_old(#valid)_AFTER_CALL_75| .cse2)) |v_old(#valid)_AFTER_CALL_75|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_75| .cse3 (select |v_old(#valid)_AFTER_CALL_76| .cse3)) |v_old(#valid)_AFTER_CALL_76|)))))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse4 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse4 (select |v_old(#valid)_AFTER_CALL_76| .cse4)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse5) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse6) (= (store |v_old(#valid)_AFTER_CALL_75| .cse6 (select |v_old(#valid)_AFTER_CALL_76| .cse6)) |v_old(#valid)_AFTER_CALL_76|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_76|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse7 (select |v_old(#valid)_AFTER_CALL_76| .cse7)) |v_old(#valid)_AFTER_CALL_76|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse7) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse8) (= (store |v_old(#valid)_AFTER_CALL_75| .cse8 (select |v_old(#valid)_AFTER_CALL_76| .cse8)) |v_old(#valid)_AFTER_CALL_76|) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= .cse9 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_49| .cse9 (select |v_old(#valid)_AFTER_CALL_75| .cse9)) |v_old(#valid)_AFTER_CALL_75|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse10) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse10 (select |v_#valid_BEFORE_CALL_49| .cse10)))))))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= .cse11 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse12) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse12 (select |v_#valid_BEFORE_CALL_49| .cse12)))))) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse11 (select |v_old(#valid)_AFTER_CALL_76| .cse11)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse5 (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)))) is different from true [2024-11-27 23:35:15,468 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_old(#valid)_AFTER_CALL_75| .cse0 (select |v_old(#valid)_AFTER_CALL_76| .cse0)) |v_old(#valid)_AFTER_CALL_76|) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_49| .cse1 (select |v_old(#valid)_AFTER_CALL_75| .cse1)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse2 (select |v_old(#valid)_AFTER_CALL_75| .cse2)) |v_old(#valid)_AFTER_CALL_75|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_75| .cse3 (select |v_old(#valid)_AFTER_CALL_76| .cse3)) |v_old(#valid)_AFTER_CALL_76|)))))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse4 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse4 (select |v_old(#valid)_AFTER_CALL_76| .cse4)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse5) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse6) (= (store |v_old(#valid)_AFTER_CALL_75| .cse6 (select |v_old(#valid)_AFTER_CALL_76| .cse6)) |v_old(#valid)_AFTER_CALL_76|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_76|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse7 (select |v_old(#valid)_AFTER_CALL_76| .cse7)) |v_old(#valid)_AFTER_CALL_76|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse7) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse8) (= (store |v_old(#valid)_AFTER_CALL_75| .cse8 (select |v_old(#valid)_AFTER_CALL_76| .cse8)) |v_old(#valid)_AFTER_CALL_76|) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= .cse9 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_49| .cse9 (select |v_old(#valid)_AFTER_CALL_75| .cse9)) |v_old(#valid)_AFTER_CALL_75|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse10) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse10 (select |v_#valid_BEFORE_CALL_49| .cse10)))))))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= .cse11 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse12) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse12 (select |v_#valid_BEFORE_CALL_49| .cse12)))))) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse11 (select |v_old(#valid)_AFTER_CALL_76| .cse11)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse5 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)))) is different from false [2024-11-27 23:35:15,483 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_old(#valid)_AFTER_CALL_75| .cse0 (select |v_old(#valid)_AFTER_CALL_76| .cse0)) |v_old(#valid)_AFTER_CALL_76|) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_49| .cse1 (select |v_old(#valid)_AFTER_CALL_75| .cse1)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse2 (select |v_old(#valid)_AFTER_CALL_75| .cse2)) |v_old(#valid)_AFTER_CALL_75|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_75| .cse3 (select |v_old(#valid)_AFTER_CALL_76| .cse3)) |v_old(#valid)_AFTER_CALL_76|)))))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse4 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse4 (select |v_old(#valid)_AFTER_CALL_76| .cse4)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse5) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse6) (= (store |v_old(#valid)_AFTER_CALL_75| .cse6 (select |v_old(#valid)_AFTER_CALL_76| .cse6)) |v_old(#valid)_AFTER_CALL_76|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_76|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse7 (select |v_old(#valid)_AFTER_CALL_76| .cse7)) |v_old(#valid)_AFTER_CALL_76|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse7) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse8) (= (store |v_old(#valid)_AFTER_CALL_75| .cse8 (select |v_old(#valid)_AFTER_CALL_76| .cse8)) |v_old(#valid)_AFTER_CALL_76|) (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= .cse9 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_49| .cse9 (select |v_old(#valid)_AFTER_CALL_75| .cse9)) |v_old(#valid)_AFTER_CALL_75|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse10) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse10 (select |v_#valid_BEFORE_CALL_49| .cse10)))))))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_49| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= .cse11 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_47| (Array Int Int))) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse12) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse12 (select |v_#valid_BEFORE_CALL_49| .cse12)))))) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse11 (select |v_old(#valid)_AFTER_CALL_76| .cse11)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse5 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)))) is different from true [2024-11-27 23:35:19,494 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (let ((.cse6 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse0 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|)) (.cse1 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse0) (= (store |v_#valid_BEFORE_CALL_49| .cse1 (select |v_old(#valid)_AFTER_CALL_75| .cse1)) |v_old(#valid)_AFTER_CALL_75|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= (store |v_old(#valid)_AFTER_CALL_75| .cse2 (select |v_old(#valid)_AFTER_CALL_76| .cse2)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse0 (select |v_#valid_BEFORE_CALL_49| .cse0))) (= (select |c_#valid| .cse1) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= (select |c_#valid| .cse4) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse4 (select |v_old(#valid)_AFTER_CALL_76| .cse4))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse3 (select |v_#valid_BEFORE_CALL_49| .cse3)))))) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_76|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse5 (select |v_old(#valid)_AFTER_CALL_76| .cse5)) |v_old(#valid)_AFTER_CALL_76|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse5) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) .cse6) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse7 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_49| .cse7 (select |v_old(#valid)_AFTER_CALL_75| .cse7)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse8) (= (store |v_old(#valid)_AFTER_CALL_75| .cse8 (select |v_old(#valid)_AFTER_CALL_76| .cse8)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse7) 1)))) (and .cse6 (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse9) (= (store |v_old(#valid)_AFTER_CALL_75| .cse9 (select |v_old(#valid)_AFTER_CALL_76| .cse9)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse10) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse10 (select |v_old(#valid)_AFTER_CALL_76| .cse10))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse11 .cse6) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|)) (.cse13 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse12 (select |v_old(#valid)_AFTER_CALL_75| .cse12)) |v_old(#valid)_AFTER_CALL_75|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse12) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse13) (= (store |v_old(#valid)_AFTER_CALL_75| .cse13 (select |v_old(#valid)_AFTER_CALL_76| .cse13)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) .cse6))) (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse11 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)))) is different from false [2024-11-27 23:35:19,508 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse11 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (let ((.cse6 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse0 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|)) (.cse1 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse0) (= (store |v_#valid_BEFORE_CALL_49| .cse1 (select |v_old(#valid)_AFTER_CALL_75| .cse1)) |v_old(#valid)_AFTER_CALL_75|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= (store |v_old(#valid)_AFTER_CALL_75| .cse2 (select |v_old(#valid)_AFTER_CALL_76| .cse2)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse0 (select |v_#valid_BEFORE_CALL_49| .cse0))) (= (select |c_#valid| .cse1) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= (select |c_#valid| .cse4) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse4 (select |v_old(#valid)_AFTER_CALL_76| .cse4))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse3 (select |v_#valid_BEFORE_CALL_49| .cse3)))))) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_76|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse5 (select |v_old(#valid)_AFTER_CALL_76| .cse5)) |v_old(#valid)_AFTER_CALL_76|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse5) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) .cse6) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse7 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_49| .cse7 (select |v_old(#valid)_AFTER_CALL_75| .cse7)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse8) (= (store |v_old(#valid)_AFTER_CALL_75| .cse8 (select |v_old(#valid)_AFTER_CALL_76| .cse8)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse7) 1)))) (and .cse6 (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse9) (= (store |v_old(#valid)_AFTER_CALL_75| .cse9 (select |v_old(#valid)_AFTER_CALL_76| .cse9)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse10) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse10 (select |v_old(#valid)_AFTER_CALL_76| .cse10))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse11 .cse6) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|)) (.cse13 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse12 (select |v_old(#valid)_AFTER_CALL_75| .cse12)) |v_old(#valid)_AFTER_CALL_75|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse12) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse13) (= (store |v_old(#valid)_AFTER_CALL_75| .cse13 (select |v_old(#valid)_AFTER_CALL_76| .cse13)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) .cse6))) (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse11 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)))) is different from true [2024-11-27 23:35:23,521 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (let ((.cse1 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse3 (exists ((v_ArrVal_6011 Int)) (= (select |c_#valid| v_ArrVal_6011) 1)))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse0) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse0 (select |v_old(#valid)_AFTER_CALL_76| .cse0)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse1) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse2 (select |v_old(#valid)_AFTER_CALL_76| .cse2))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse3) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|)) (.cse4 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse4) (= (select |c_#valid| .cse5) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse5 (select |v_old(#valid)_AFTER_CALL_76| .cse5))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse4 (select |v_#valid_BEFORE_CALL_49| .cse4)))))) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse6 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|)) (.cse7 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse6) (= (store |v_#valid_BEFORE_CALL_49| .cse7 (select |v_old(#valid)_AFTER_CALL_75| .cse7)) |v_old(#valid)_AFTER_CALL_75|) (= (select |c_#valid| .cse8) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse8 (select |v_old(#valid)_AFTER_CALL_76| .cse8)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse6 (select |v_#valid_BEFORE_CALL_49| .cse6))) (= (select |c_#valid| .cse7) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse9 .cse1 .cse3) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|)) (.cse11 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse10 (select |v_old(#valid)_AFTER_CALL_75| .cse10)) |v_old(#valid)_AFTER_CALL_75|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse10) (= (select |c_#valid| .cse11) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse11 (select |v_old(#valid)_AFTER_CALL_76| .cse11)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_76|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse12 (select |v_old(#valid)_AFTER_CALL_76| .cse12)) |v_old(#valid)_AFTER_CALL_76|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse12) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) .cse1 .cse3) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse13 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_49| .cse13 (select |v_old(#valid)_AFTER_CALL_75| .cse13)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse14) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse14 (select |v_old(#valid)_AFTER_CALL_76| .cse14)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse13) 1)))))) (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse9 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)))) is different from false [2024-11-27 23:35:23,533 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (let ((.cse1 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse3 (exists ((v_ArrVal_6011 Int)) (= (select |c_#valid| v_ArrVal_6011) 1)))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse0) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse0 (select |v_old(#valid)_AFTER_CALL_76| .cse0)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse1) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse2 (select |v_old(#valid)_AFTER_CALL_76| .cse2))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse3) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|)) (.cse4 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse4) (= (select |c_#valid| .cse5) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse5 (select |v_old(#valid)_AFTER_CALL_76| .cse5))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse4 (select |v_#valid_BEFORE_CALL_49| .cse4)))))) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse6 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|)) (.cse7 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse6) (= (store |v_#valid_BEFORE_CALL_49| .cse7 (select |v_old(#valid)_AFTER_CALL_75| .cse7)) |v_old(#valid)_AFTER_CALL_75|) (= (select |c_#valid| .cse8) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse8 (select |v_old(#valid)_AFTER_CALL_76| .cse8)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse6 (select |v_#valid_BEFORE_CALL_49| .cse6))) (= (select |c_#valid| .cse7) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse9 .cse1 .cse3) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|)) (.cse11 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse10 (select |v_old(#valid)_AFTER_CALL_75| .cse10)) |v_old(#valid)_AFTER_CALL_75|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse10) (= (select |c_#valid| .cse11) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse11 (select |v_old(#valid)_AFTER_CALL_76| .cse11)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_76|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse12 (select |v_old(#valid)_AFTER_CALL_76| .cse12)) |v_old(#valid)_AFTER_CALL_76|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse12) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) .cse1 .cse3) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse13 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_49| .cse13 (select |v_old(#valid)_AFTER_CALL_75| .cse13)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse14) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse14 (select |v_old(#valid)_AFTER_CALL_76| .cse14)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse13) 1)))))) (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse9 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)))) is different from true [2024-11-27 23:35:27,549 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)) (let ((.cse8 (exists ((v_ArrVal_6011 Int)) (= (select |c_#valid| v_ArrVal_6011) 1))) (.cse6 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse9 (exists ((|ULTIMATE.start_l3_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse1 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= (store |v_#valid_BEFORE_CALL_49| .cse1 (select |v_old(#valid)_AFTER_CALL_75| .cse1)) |v_old(#valid)_AFTER_CALL_75|) (= (select |c_#valid| .cse2) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse2 (select |v_old(#valid)_AFTER_CALL_76| .cse2)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse3 (select |v_#valid_BEFORE_CALL_49| .cse3))) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| .cse3) 1)))) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse4 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse4 (select |v_old(#valid)_AFTER_CALL_75| .cse4)) |v_old(#valid)_AFTER_CALL_75|) (= (select |c_#valid| .cse5) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse5 (select |v_old(#valid)_AFTER_CALL_76| .cse5)) |v_old(#valid)_AFTER_CALL_76|) (= (select |c_#valid| .cse4) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) .cse6) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse7) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse7 (select |v_old(#valid)_AFTER_CALL_76| .cse7))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse8 .cse9) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|)) (.cse11 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= (select |c_#valid| .cse10) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse10 (select |v_old(#valid)_AFTER_CALL_76| .cse10))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse11 (select |v_#valid_BEFORE_CALL_49| .cse11))) (= (select |c_#valid| .cse11) 1)))) .cse8) (and .cse9 (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse12 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_49| .cse12 (select |v_old(#valid)_AFTER_CALL_75| .cse12)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse13) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse13 (select |v_old(#valid)_AFTER_CALL_76| .cse13)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse12) 1))))) (and .cse6 .cse8 (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse14 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |c_#valid| .cse14) 1) (= (store |v_#valid_BEFORE_CALL_47| .cse14 (select |v_old(#valid)_AFTER_CALL_76| .cse14)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 .cse6 .cse8 .cse9) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse15 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse15) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse15 (select |v_old(#valid)_AFTER_CALL_76| .cse15)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse6 .cse9))))) is different from false [2024-11-27 23:35:27,560 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)) (let ((.cse8 (exists ((v_ArrVal_6011 Int)) (= (select |c_#valid| v_ArrVal_6011) 1))) (.cse6 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse9 (exists ((|ULTIMATE.start_l3_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse1 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= (store |v_#valid_BEFORE_CALL_49| .cse1 (select |v_old(#valid)_AFTER_CALL_75| .cse1)) |v_old(#valid)_AFTER_CALL_75|) (= (select |c_#valid| .cse2) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse2 (select |v_old(#valid)_AFTER_CALL_76| .cse2)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse3 (select |v_#valid_BEFORE_CALL_49| .cse3))) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| .cse3) 1)))) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse4 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse4 (select |v_old(#valid)_AFTER_CALL_75| .cse4)) |v_old(#valid)_AFTER_CALL_75|) (= (select |c_#valid| .cse5) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse5 (select |v_old(#valid)_AFTER_CALL_76| .cse5)) |v_old(#valid)_AFTER_CALL_76|) (= (select |c_#valid| .cse4) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) .cse6) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse7) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse7 (select |v_old(#valid)_AFTER_CALL_76| .cse7))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse8 .cse9) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|)) (.cse11 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= (select |c_#valid| .cse10) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse10 (select |v_old(#valid)_AFTER_CALL_76| .cse10))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse11 (select |v_#valid_BEFORE_CALL_49| .cse11))) (= (select |c_#valid| .cse11) 1)))) .cse8) (and .cse9 (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse12 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_49| .cse12 (select |v_old(#valid)_AFTER_CALL_75| .cse12)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse13) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse13 (select |v_old(#valid)_AFTER_CALL_76| .cse13)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse12) 1))))) (and .cse6 .cse8 (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse14 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |c_#valid| .cse14) 1) (= (store |v_#valid_BEFORE_CALL_47| .cse14 (select |v_old(#valid)_AFTER_CALL_76| .cse14)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 .cse6 .cse8 .cse9) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse15 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse15) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse15 (select |v_old(#valid)_AFTER_CALL_76| .cse15)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse6 .cse9))))) is different from true [2024-11-27 23:35:31,574 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)) (let ((.cse8 (exists ((v_ArrVal_6011 Int)) (= (select |c_#valid| v_ArrVal_6011) 1))) (.cse6 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse9 (exists ((|ULTIMATE.start_l3_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse1 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= (store |v_#valid_BEFORE_CALL_49| .cse1 (select |v_old(#valid)_AFTER_CALL_75| .cse1)) |v_old(#valid)_AFTER_CALL_75|) (= (select |c_#valid| .cse2) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse2 (select |v_old(#valid)_AFTER_CALL_76| .cse2)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse3 (select |v_#valid_BEFORE_CALL_49| .cse3))) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| .cse3) 1)))) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse4 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse4 (select |v_old(#valid)_AFTER_CALL_75| .cse4)) |v_old(#valid)_AFTER_CALL_75|) (= (select |c_#valid| .cse5) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse5 (select |v_old(#valid)_AFTER_CALL_76| .cse5)) |v_old(#valid)_AFTER_CALL_76|) (= (select |c_#valid| .cse4) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) .cse6) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse7) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse7 (select |v_old(#valid)_AFTER_CALL_76| .cse7))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse8 .cse9) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|)) (.cse11 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= (select |c_#valid| .cse10) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse10 (select |v_old(#valid)_AFTER_CALL_76| .cse10))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse11 (select |v_#valid_BEFORE_CALL_49| .cse11))) (= (select |c_#valid| .cse11) 1)))) .cse8) (and .cse9 (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse12 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_49| .cse12 (select |v_old(#valid)_AFTER_CALL_75| .cse12)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse13) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse13 (select |v_old(#valid)_AFTER_CALL_76| .cse13)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse12) 1))))) (and .cse6 .cse8 (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse14 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |c_#valid| .cse14) 1) (= (store |v_#valid_BEFORE_CALL_47| .cse14 (select |v_old(#valid)_AFTER_CALL_76| .cse14)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 .cse6 .cse8 .cse9) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse15 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse15) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse15 (select |v_old(#valid)_AFTER_CALL_76| .cse15)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse6 .cse9))))) is different from false [2024-11-27 23:35:31,586 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)) (let ((.cse8 (exists ((v_ArrVal_6011 Int)) (= (select |c_#valid| v_ArrVal_6011) 1))) (.cse6 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse9 (exists ((|ULTIMATE.start_l3_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse1 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= (store |v_#valid_BEFORE_CALL_49| .cse1 (select |v_old(#valid)_AFTER_CALL_75| .cse1)) |v_old(#valid)_AFTER_CALL_75|) (= (select |c_#valid| .cse2) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse2 (select |v_old(#valid)_AFTER_CALL_76| .cse2)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse3 (select |v_#valid_BEFORE_CALL_49| .cse3))) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| .cse3) 1)))) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse4 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse4 (select |v_old(#valid)_AFTER_CALL_75| .cse4)) |v_old(#valid)_AFTER_CALL_75|) (= (select |c_#valid| .cse5) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse5 (select |v_old(#valid)_AFTER_CALL_76| .cse5)) |v_old(#valid)_AFTER_CALL_76|) (= (select |c_#valid| .cse4) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) .cse6) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse7) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse7 (select |v_old(#valid)_AFTER_CALL_76| .cse7))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse8 .cse9) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|)) (.cse11 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= (select |c_#valid| .cse10) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse10 (select |v_old(#valid)_AFTER_CALL_76| .cse10))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse11 (select |v_#valid_BEFORE_CALL_49| .cse11))) (= (select |c_#valid| .cse11) 1)))) .cse8) (and .cse9 (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse12 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_49| .cse12 (select |v_old(#valid)_AFTER_CALL_75| .cse12)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse13) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse13 (select |v_old(#valid)_AFTER_CALL_76| .cse13)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse12) 1))))) (and .cse6 .cse8 (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse14 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |c_#valid| .cse14) 1) (= (store |v_#valid_BEFORE_CALL_47| .cse14 (select |v_old(#valid)_AFTER_CALL_76| .cse14)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 .cse6 .cse8 .cse9) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse15 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse15) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse15 (select |v_old(#valid)_AFTER_CALL_76| .cse15)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse6 .cse9))))) is different from true [2024-11-27 23:35:35,607 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)) (let ((.cse8 (exists ((v_ArrVal_6011 Int)) (= (select |c_#valid| v_ArrVal_6011) 1))) (.cse6 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse9 (exists ((|ULTIMATE.start_l3_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse1 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= (store |v_#valid_BEFORE_CALL_49| .cse1 (select |v_old(#valid)_AFTER_CALL_75| .cse1)) |v_old(#valid)_AFTER_CALL_75|) (= (select |c_#valid| .cse2) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse2 (select |v_old(#valid)_AFTER_CALL_76| .cse2)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse3 (select |v_#valid_BEFORE_CALL_49| .cse3))) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| .cse3) 1)))) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse4 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse4 (select |v_old(#valid)_AFTER_CALL_75| .cse4)) |v_old(#valid)_AFTER_CALL_75|) (= (select |c_#valid| .cse5) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse5 (select |v_old(#valid)_AFTER_CALL_76| .cse5)) |v_old(#valid)_AFTER_CALL_76|) (= (select |c_#valid| .cse4) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) .cse6) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse7) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse7 (select |v_old(#valid)_AFTER_CALL_76| .cse7))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse8 .cse9) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|)) (.cse11 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= (select |c_#valid| .cse10) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse10 (select |v_old(#valid)_AFTER_CALL_76| .cse10))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse11 (select |v_#valid_BEFORE_CALL_49| .cse11))) (= (select |c_#valid| .cse11) 1)))) .cse8) (and .cse9 (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse12 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_49| .cse12 (select |v_old(#valid)_AFTER_CALL_75| .cse12)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse13) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse13 (select |v_old(#valid)_AFTER_CALL_76| .cse13)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse12) 1))))) (and .cse6 .cse8 (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse14 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |c_#valid| .cse14) 1) (= (store |v_#valid_BEFORE_CALL_47| .cse14 (select |v_old(#valid)_AFTER_CALL_76| .cse14)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 .cse6 .cse8 .cse9) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse15 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse15) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse15 (select |v_old(#valid)_AFTER_CALL_76| .cse15)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse6 .cse9))))) is different from false [2024-11-27 23:35:35,619 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)) (let ((.cse8 (exists ((v_ArrVal_6011 Int)) (= (select |c_#valid| v_ArrVal_6011) 1))) (.cse6 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse9 (exists ((|ULTIMATE.start_l3_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse1 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= (store |v_#valid_BEFORE_CALL_49| .cse1 (select |v_old(#valid)_AFTER_CALL_75| .cse1)) |v_old(#valid)_AFTER_CALL_75|) (= (select |c_#valid| .cse2) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse2 (select |v_old(#valid)_AFTER_CALL_76| .cse2)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse3 (select |v_#valid_BEFORE_CALL_49| .cse3))) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| .cse3) 1)))) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse4 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse4 (select |v_old(#valid)_AFTER_CALL_75| .cse4)) |v_old(#valid)_AFTER_CALL_75|) (= (select |c_#valid| .cse5) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse5 (select |v_old(#valid)_AFTER_CALL_76| .cse5)) |v_old(#valid)_AFTER_CALL_76|) (= (select |c_#valid| .cse4) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) .cse6) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse7) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse7 (select |v_old(#valid)_AFTER_CALL_76| .cse7))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse8 .cse9) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|)) (.cse11 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= (select |c_#valid| .cse10) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse10 (select |v_old(#valid)_AFTER_CALL_76| .cse10))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse11 (select |v_#valid_BEFORE_CALL_49| .cse11))) (= (select |c_#valid| .cse11) 1)))) .cse8) (and .cse9 (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse12 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_49| .cse12 (select |v_old(#valid)_AFTER_CALL_75| .cse12)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse13) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse13 (select |v_old(#valid)_AFTER_CALL_76| .cse13)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse12) 1))))) (and .cse6 .cse8 (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse14 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |c_#valid| .cse14) 1) (= (store |v_#valid_BEFORE_CALL_47| .cse14 (select |v_old(#valid)_AFTER_CALL_76| .cse14)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 .cse6 .cse8 .cse9) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse15 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse15) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse15 (select |v_old(#valid)_AFTER_CALL_76| .cse15)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse6 .cse9))))) is different from true [2024-11-27 23:35:39,633 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and .cse0 (let ((.cse8 (exists ((v_ArrVal_6011 Int)) (= (select |c_#valid| v_ArrVal_6011) 1))) (.cse6 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse9 (exists ((|ULTIMATE.start_l3_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse1 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= (store |v_#valid_BEFORE_CALL_49| .cse1 (select |v_old(#valid)_AFTER_CALL_75| .cse1)) |v_old(#valid)_AFTER_CALL_75|) (= (select |c_#valid| .cse2) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse2 (select |v_old(#valid)_AFTER_CALL_76| .cse2)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse3 (select |v_#valid_BEFORE_CALL_49| .cse3))) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| .cse3) 1)))) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse4 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse4 (select |v_old(#valid)_AFTER_CALL_75| .cse4)) |v_old(#valid)_AFTER_CALL_75|) (= (select |c_#valid| .cse5) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse5 (select |v_old(#valid)_AFTER_CALL_76| .cse5)) |v_old(#valid)_AFTER_CALL_76|) (= (select |c_#valid| .cse4) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) .cse6) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse7) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse7 (select |v_old(#valid)_AFTER_CALL_76| .cse7))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse8 .cse9) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|)) (.cse11 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= (select |c_#valid| .cse10) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse10 (select |v_old(#valid)_AFTER_CALL_76| .cse10))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse11 (select |v_#valid_BEFORE_CALL_49| .cse11))) (= (select |c_#valid| .cse11) 1)))) .cse8) (and .cse9 (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse12 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_49| .cse12 (select |v_old(#valid)_AFTER_CALL_75| .cse12)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse13) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse13 (select |v_old(#valid)_AFTER_CALL_76| .cse13)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse12) 1))))) (and .cse6 .cse8 (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse14 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |c_#valid| .cse14) 1) (= (store |v_#valid_BEFORE_CALL_47| .cse14 (select |v_old(#valid)_AFTER_CALL_76| .cse14)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 .cse6 .cse8 .cse9) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse15 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse15) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse15 (select |v_old(#valid)_AFTER_CALL_76| .cse15)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse6 .cse9))))) is different from false [2024-11-27 23:35:39,646 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and .cse0 (let ((.cse8 (exists ((v_ArrVal_6011 Int)) (= (select |c_#valid| v_ArrVal_6011) 1))) (.cse6 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse9 (exists ((|ULTIMATE.start_l3_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse1 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= (store |v_#valid_BEFORE_CALL_49| .cse1 (select |v_old(#valid)_AFTER_CALL_75| .cse1)) |v_old(#valid)_AFTER_CALL_75|) (= (select |c_#valid| .cse2) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse2 (select |v_old(#valid)_AFTER_CALL_76| .cse2)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse3 (select |v_#valid_BEFORE_CALL_49| .cse3))) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| .cse3) 1)))) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse4 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_47| .cse4 (select |v_old(#valid)_AFTER_CALL_75| .cse4)) |v_old(#valid)_AFTER_CALL_75|) (= (select |c_#valid| .cse5) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse5 (select |v_old(#valid)_AFTER_CALL_76| .cse5)) |v_old(#valid)_AFTER_CALL_76|) (= (select |c_#valid| .cse4) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) .cse6) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse7) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse7 (select |v_old(#valid)_AFTER_CALL_76| .cse7))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse8 .cse9) (and (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_76|)) (.cse11 (@diff |v_#valid_BEFORE_CALL_47| |v_#valid_BEFORE_CALL_49|))) (and (= (select |c_#valid| .cse10) 1) (= |v_old(#valid)_AFTER_CALL_76| (store |v_#valid_BEFORE_CALL_49| .cse10 (select |v_old(#valid)_AFTER_CALL_76| .cse10))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_49| (store |v_#valid_BEFORE_CALL_47| .cse11 (select |v_#valid_BEFORE_CALL_49| .cse11))) (= (select |c_#valid| .cse11) 1)))) .cse8) (and .cse9 (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_49| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|)) (.cse12 (@diff |v_#valid_BEFORE_CALL_49| |v_old(#valid)_AFTER_CALL_75|))) (and (= (store |v_#valid_BEFORE_CALL_49| .cse12 (select |v_old(#valid)_AFTER_CALL_75| .cse12)) |v_old(#valid)_AFTER_CALL_75|) (= (select |v_#valid_BEFORE_CALL_49| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse13) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse13 (select |v_old(#valid)_AFTER_CALL_76| .cse13)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse12) 1))))) (and .cse6 .cse8 (exists ((|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_#valid_BEFORE_CALL_47| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse14 (@diff |v_#valid_BEFORE_CALL_47| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |c_#valid| .cse14) 1) (= (store |v_#valid_BEFORE_CALL_47| .cse14 (select |v_old(#valid)_AFTER_CALL_76| .cse14)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_47| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 .cse6 .cse8 .cse9) (and (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse15 (@diff |v_old(#valid)_AFTER_CALL_75| |v_old(#valid)_AFTER_CALL_76|))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse15) 1) (= (store |v_old(#valid)_AFTER_CALL_75| .cse15 (select |v_old(#valid)_AFTER_CALL_76| .cse15)) |v_old(#valid)_AFTER_CALL_76|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_76| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse6 .cse9))))) is different from true [2024-11-27 23:35:41,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:35:41,955 INFO L93 Difference]: Finished difference Result 369 states and 432 transitions. [2024-11-27 23:35:41,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-27 23:35:41,956 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 38 states have (on average 2.8421052631578947) internal successors, (108), 33 states have internal predecessors, (108), 9 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) Word has length 135 [2024-11-27 23:35:41,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:35:41,958 INFO L225 Difference]: With dead ends: 369 [2024-11-27 23:35:41,958 INFO L226 Difference]: Without dead ends: 369 [2024-11-27 23:35:41,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 156 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 31 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 70.4s TimeCoverageRelationStatistics Valid=208, Invalid=1188, Unknown=60, NotChecked=3100, Total=4556 [2024-11-27 23:35:41,959 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 570 mSDsluCounter, 2941 mSDsCounter, 0 mSdLazyCounter, 2023 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 3134 SdHoareTripleChecker+Invalid, 9066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6970 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-27 23:35:41,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 3134 Invalid, 9066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2023 Invalid, 0 Unknown, 6970 Unchecked, 2.7s Time] [2024-11-27 23:35:41,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-27 23:35:41,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 268. [2024-11-27 23:35:41,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 185 states have (on average 1.4972972972972973) internal successors, (277), 247 states have internal predecessors, (277), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-27 23:35:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 311 transitions. [2024-11-27 23:35:41,971 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 311 transitions. Word has length 135 [2024-11-27 23:35:41,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:35:41,972 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 311 transitions. [2024-11-27 23:35:41,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 38 states have (on average 2.8421052631578947) internal successors, (108), 33 states have internal predecessors, (108), 9 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-27 23:35:41,972 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 311 transitions. [2024-11-27 23:35:41,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-27 23:35:41,974 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:35:41,974 INFO L218 NwaCegarLoop]: trace histogram [42, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:35:41,990 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-27 23:35:42,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-27 23:35:42,175 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-27 23:35:42,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:35:42,176 INFO L85 PathProgramCache]: Analyzing trace with hash 641070130, now seen corresponding path program 1 times [2024-11-27 23:35:42,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:35:42,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541743785] [2024-11-27 23:35:42,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:35:42,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:35:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:35:50,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 5 proven. 914 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2024-11-27 23:35:50,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:35:50,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541743785] [2024-11-27 23:35:50,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541743785] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:35:50,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627634920] [2024-11-27 23:35:50,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:35:50,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:35:50,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:35:50,156 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:35:50,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-27 23:35:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:35:53,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 1311 conjuncts, 196 conjuncts are in the unsatisfiable core [2024-11-27 23:35:53,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:35:53,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 9 [2024-11-27 23:36:02,241 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|) (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2024-11-27 23:36:03,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:36:03,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-11-27 23:36:04,019 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 23:36:04,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-27 23:36:05,072 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-27 23:36:05,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-11-27 23:36:05,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-11-27 23:36:09,887 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2024-11-27 23:36:09,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 22 [2024-11-27 23:36:09,929 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-27 23:36:09,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-27 23:36:14,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:36:14,077 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-27 23:36:14,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 54 [2024-11-27 23:36:14,273 INFO L349 Elim1Store]: treesize reduction 62, result has 36.7 percent of original size [2024-11-27 23:36:14,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 65 treesize of output 91 [2024-11-27 23:36:16,808 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2024-11-27 23:36:16,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:36:16,942 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-27 23:36:16,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 58 [2024-11-27 23:36:17,072 INFO L349 Elim1Store]: treesize reduction 12, result has 78.9 percent of original size [2024-11-27 23:36:17,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 68 treesize of output 102 [2024-11-27 23:36:24,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 94 proven. 788 refuted. 0 times theorem prover too weak. 86 trivial. 280 not checked. [2024-11-27 23:36:24,568 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:36:25,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627634920] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:36:25,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 23:36:25,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 64] total 100 [2024-11-27 23:36:25,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169234907] [2024-11-27 23:36:25,568 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 23:36:25,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2024-11-27 23:36:25,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:36:25,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2024-11-27 23:36:25,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=9932, Unknown=3, NotChecked=402, Total=10712 [2024-11-27 23:36:25,571 INFO L87 Difference]: Start difference. First operand 268 states and 311 transitions. Second operand has 101 states, 96 states have (on average 1.875) internal successors, (180), 91 states have internal predecessors, (180), 8 states have call successors, (11), 2 states have call predecessors, (11), 11 states have return successors, (12), 12 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-27 23:36:29,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-27 23:36:33,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-27 23:36:40,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-27 23:36:44,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-27 23:36:49,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-27 23:36:54,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-27 23:36:59,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-27 23:37:04,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-27 23:37:08,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-27 23:37:16,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-27 23:37:18,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-27 23:37:45,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-27 23:38:14,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-27 23:38:24,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-27 23:38:42,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-27 23:38:59,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-27 23:39:01,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-27 23:39:06,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-27 23:39:38,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:39:38,016 INFO L93 Difference]: Finished difference Result 489 states and 605 transitions. [2024-11-27 23:39:38,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-11-27 23:39:38,017 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 96 states have (on average 1.875) internal successors, (180), 91 states have internal predecessors, (180), 8 states have call successors, (11), 2 states have call predecessors, (11), 11 states have return successors, (12), 12 states have call predecessors, (12), 8 states have call successors, (12) Word has length 135 [2024-11-27 23:39:38,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:39:38,019 INFO L225 Difference]: With dead ends: 489 [2024-11-27 23:39:38,019 INFO L226 Difference]: Without dead ends: 489 [2024-11-27 23:39:38,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 151 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6145 ImplicationChecksByTransitivity, 111.3s TimeCoverageRelationStatistics Valid=1352, Invalid=21295, Unknown=11, NotChecked=598, Total=23256 [2024-11-27 23:39:38,022 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 674 mSDsluCounter, 2614 mSDsCounter, 0 mSdLazyCounter, 13148 mSolverCounterSat, 163 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 105.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 2709 SdHoareTripleChecker+Invalid, 14203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 13148 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 876 IncrementalHoareTripleChecker+Unchecked, 107.6s IncrementalHoareTripleChecker+Time [2024-11-27 23:39:38,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 2709 Invalid, 14203 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [163 Valid, 13148 Invalid, 16 Unknown, 876 Unchecked, 107.6s Time] [2024-11-27 23:39:38,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-11-27 23:39:38,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 225. [2024-11-27 23:39:38,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 153 states have (on average 1.5294117647058822) internal successors, (234), 209 states have internal predecessors, (234), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-27 23:39:38,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 258 transitions. [2024-11-27 23:39:38,052 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 258 transitions. Word has length 135 [2024-11-27 23:39:38,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:39:38,052 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 258 transitions. [2024-11-27 23:39:38,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 96 states have (on average 1.875) internal successors, (180), 91 states have internal predecessors, (180), 8 states have call successors, (11), 2 states have call predecessors, (11), 11 states have return successors, (12), 12 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-27 23:39:38,053 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 258 transitions. [2024-11-27 23:39:38,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-27 23:39:38,055 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:39:38,055 INFO L218 NwaCegarLoop]: trace histogram [42, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:39:38,099 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-27 23:39:38,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-27 23:39:38,256 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-27 23:39:38,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:39:38,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1943350371, now seen corresponding path program 1 times [2024-11-27 23:39:38,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:39:38,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563991069] [2024-11-27 23:39:38,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:39:38,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:39:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:39:41,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 150 proven. 20 refuted. 0 times theorem prover too weak. 1078 trivial. 0 not checked. [2024-11-27 23:39:41,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:39:41,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563991069] [2024-11-27 23:39:41,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563991069] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:39:41,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537841956] [2024-11-27 23:39:41,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:39:41,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:39:41,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:39:41,853 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:39:41,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-27 23:39:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:39:42,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 1356 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-27 23:39:42,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:39:43,063 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-27 23:39:43,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-27 23:39:43,290 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2024-11-27 23:39:43,361 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-27 23:39:43,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2024-11-27 23:39:43,582 INFO L349 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2024-11-27 23:39:43,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 38 [2024-11-27 23:39:43,835 INFO L349 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2024-11-27 23:39:43,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 38 [2024-11-27 23:39:44,084 INFO L349 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2024-11-27 23:39:44,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 38 [2024-11-27 23:39:44,271 INFO L349 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2024-11-27 23:39:44,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 38 [2024-11-27 23:39:44,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 862 trivial. 381 not checked. [2024-11-27 23:39:44,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:39:45,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537841956] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:39:45,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 23:39:45,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 13] total 37 [2024-11-27 23:39:45,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868683673] [2024-11-27 23:39:45,111 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 23:39:45,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-27 23:39:45,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:39:45,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-27 23:39:45,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1346, Unknown=1, NotChecked=76, Total=1640 [2024-11-27 23:39:45,113 INFO L87 Difference]: Start difference. First operand 225 states and 258 transitions. Second operand has 39 states, 35 states have (on average 3.1714285714285713) internal successors, (111), 29 states have internal predecessors, (111), 8 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-27 23:39:48,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:39:48,214 INFO L93 Difference]: Finished difference Result 451 states and 527 transitions. [2024-11-27 23:39:48,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-27 23:39:48,214 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 35 states have (on average 3.1714285714285713) internal successors, (111), 29 states have internal predecessors, (111), 8 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 141 [2024-11-27 23:39:48,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:39:48,216 INFO L225 Difference]: With dead ends: 451 [2024-11-27 23:39:48,217 INFO L226 Difference]: Without dead ends: 451 [2024-11-27 23:39:48,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 175 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=321, Invalid=1844, Unknown=1, NotChecked=90, Total=2256 [2024-11-27 23:39:48,218 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 1284 mSDsluCounter, 2294 mSDsCounter, 0 mSdLazyCounter, 1796 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1284 SdHoareTripleChecker+Valid, 2462 SdHoareTripleChecker+Invalid, 2400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 492 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-27 23:39:48,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1284 Valid, 2462 Invalid, 2400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1796 Invalid, 0 Unknown, 492 Unchecked, 2.7s Time] [2024-11-27 23:39:48,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-11-27 23:39:48,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 328. [2024-11-27 23:39:48,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 252 states have (on average 1.5952380952380953) internal successors, (402), 305 states have internal predecessors, (402), 17 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (28), 18 states have call predecessors, (28), 17 states have call successors, (28) [2024-11-27 23:39:48,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 447 transitions. [2024-11-27 23:39:48,234 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 447 transitions. Word has length 141 [2024-11-27 23:39:48,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:39:48,235 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 447 transitions. [2024-11-27 23:39:48,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 35 states have (on average 3.1714285714285713) internal successors, (111), 29 states have internal predecessors, (111), 8 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-27 23:39:48,235 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 447 transitions. [2024-11-27 23:39:48,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-27 23:39:48,237 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:39:48,237 INFO L218 NwaCegarLoop]: trace histogram [42, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:39:48,258 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-27 23:39:48,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-27 23:39:48,437 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-27 23:39:48,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:39:48,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1943350370, now seen corresponding path program 1 times [2024-11-27 23:39:48,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:39:48,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517238404] [2024-11-27 23:39:48,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:39:48,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:39:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:39:50,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 1073 trivial. 0 not checked. [2024-11-27 23:39:50,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:39:50,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517238404] [2024-11-27 23:39:50,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517238404] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:39:50,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128742709] [2024-11-27 23:39:50,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:39:50,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:39:50,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:39:50,977 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:39:50,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-27 23:39:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:39:51,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 1356 conjuncts, 132 conjuncts are in the unsatisfiable core [2024-11-27 23:39:51,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:39:52,020 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|) (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2024-11-27 23:39:52,202 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 23:39:52,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-27 23:39:52,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-11-27 23:39:52,330 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= |c_#valid| (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|))) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2024-11-27 23:39:52,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:39:52,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-11-27 23:39:52,542 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-27 23:39:52,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-11-27 23:39:52,998 INFO L349 Elim1Store]: treesize reduction 24, result has 44.2 percent of original size [2024-11-27 23:39:52,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 25 [2024-11-27 23:39:53,039 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-27 23:39:53,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-27 23:39:53,579 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-11-27 23:39:53,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 33 treesize of output 47 [2024-11-27 23:39:53,671 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-27 23:39:53,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2024-11-27 23:39:54,898 INFO L349 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2024-11-27 23:39:54,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 41 treesize of output 62 [2024-11-27 23:39:55,158 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-27 23:39:55,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-27 23:39:55,682 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2024-11-27 23:39:55,935 INFO L349 Elim1Store]: treesize reduction 4, result has 91.8 percent of original size [2024-11-27 23:39:55,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 85 [2024-11-27 23:39:55,975 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-27 23:39:55,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 24 treesize of output 23 [2024-11-27 23:39:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 176 proven. 3 refuted. 0 times theorem prover too weak. 286 trivial. 783 not checked. [2024-11-27 23:39:58,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:39:59,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128742709] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:39:59,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 23:39:59,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 28] total 37 [2024-11-27 23:39:59,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090330677] [2024-11-27 23:39:59,670 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 23:39:59,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-27 23:39:59,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:39:59,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-27 23:39:59,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1495, Unknown=3, NotChecked=240, Total=1892 [2024-11-27 23:39:59,672 INFO L87 Difference]: Start difference. First operand 328 states and 447 transitions. Second operand has 39 states, 35 states have (on average 4.057142857142857) internal successors, (142), 31 states have internal predecessors, (142), 6 states have call successors, (12), 3 states have call predecessors, (12), 7 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-27 23:40:12,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:40:12,630 INFO L93 Difference]: Finished difference Result 450 states and 530 transitions. [2024-11-27 23:40:12,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-27 23:40:12,631 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 35 states have (on average 4.057142857142857) internal successors, (142), 31 states have internal predecessors, (142), 6 states have call successors, (12), 3 states have call predecessors, (12), 7 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) Word has length 141 [2024-11-27 23:40:12,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:40:12,632 INFO L225 Difference]: With dead ends: 450 [2024-11-27 23:40:12,632 INFO L226 Difference]: Without dead ends: 450 [2024-11-27 23:40:12,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 145 SyntacticMatches, 8 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=479, Invalid=3070, Unknown=3, NotChecked=354, Total=3906 [2024-11-27 23:40:12,634 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 816 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 5835 mSolverCounterSat, 59 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 7380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 5835 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 1483 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2024-11-27 23:40:12,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 992 Invalid, 7380 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [59 Valid, 5835 Invalid, 3 Unknown, 1483 Unchecked, 10.5s Time] [2024-11-27 23:40:12,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-11-27 23:40:12,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 325. [2024-11-27 23:40:12,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 252 states have (on average 1.5595238095238095) internal successors, (393), 302 states have internal predecessors, (393), 17 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (28), 18 states have call predecessors, (28), 17 states have call successors, (28) [2024-11-27 23:40:12,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 438 transitions. [2024-11-27 23:40:12,649 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 438 transitions. Word has length 141 [2024-11-27 23:40:12,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:40:12,650 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 438 transitions. [2024-11-27 23:40:12,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 35 states have (on average 4.057142857142857) internal successors, (142), 31 states have internal predecessors, (142), 6 states have call successors, (12), 3 states have call predecessors, (12), 7 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-27 23:40:12,650 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 438 transitions. [2024-11-27 23:40:12,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-27 23:40:12,657 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:40:12,658 INFO L218 NwaCegarLoop]: trace histogram [42, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:40:12,676 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-27 23:40:12,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:40:12,859 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting l0_destroyErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-27 23:40:12,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:40:12,859 INFO L85 PathProgramCache]: Analyzing trace with hash -805282936, now seen corresponding path program 1 times [2024-11-27 23:40:12,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:40:12,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993562707] [2024-11-27 23:40:12,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:40:12,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:40:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:40:13,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1248 trivial. 0 not checked. [2024-11-27 23:40:13,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:40:13,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993562707] [2024-11-27 23:40:13,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993562707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:40:13,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:40:13,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 23:40:13,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478776669] [2024-11-27 23:40:13,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:40:13,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 23:40:13,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:40:13,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 23:40:13,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:40:13,076 INFO L87 Difference]: Start difference. First operand 325 states and 438 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-27 23:40:13,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:40:13,129 INFO L93 Difference]: Finished difference Result 465 states and 620 transitions. [2024-11-27 23:40:13,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 23:40:13,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 151 [2024-11-27 23:40:13,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:40:13,132 INFO L225 Difference]: With dead ends: 465 [2024-11-27 23:40:13,132 INFO L226 Difference]: Without dead ends: 465 [2024-11-27 23:40:13,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:40:13,133 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 215 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:40:13,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 655 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:40:13,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-11-27 23:40:13,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 430. [2024-11-27 23:40:13,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 355 states have (on average 1.619718309859155) internal successors, (575), 406 states have internal predecessors, (575), 17 states have call successors, (17), 5 states have call predecessors, (17), 7 states have return successors, (28), 18 states have call predecessors, (28), 17 states have call successors, (28) [2024-11-27 23:40:13,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 620 transitions. [2024-11-27 23:40:13,148 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 620 transitions. Word has length 151 [2024-11-27 23:40:13,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:40:13,148 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 620 transitions. [2024-11-27 23:40:13,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-27 23:40:13,149 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 620 transitions. [2024-11-27 23:40:13,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-27 23:40:13,151 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:40:13,151 INFO L218 NwaCegarLoop]: trace histogram [42, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:40:13,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-27 23:40:13,151 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-27 23:40:13,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:40:13,152 INFO L85 PathProgramCache]: Analyzing trace with hash -805288409, now seen corresponding path program 1 times [2024-11-27 23:40:13,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:40:13,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459531901] [2024-11-27 23:40:13,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:40:13,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:40:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:40:14,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1248 trivial. 0 not checked. [2024-11-27 23:40:14,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:40:14,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459531901] [2024-11-27 23:40:14,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459531901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:40:14,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:40:14,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 23:40:14,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568569290] [2024-11-27 23:40:14,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:40:14,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 23:40:14,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:40:14,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 23:40:14,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-27 23:40:14,236 INFO L87 Difference]: Start difference. First operand 430 states and 620 transitions. Second operand has 8 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-27 23:40:15,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:40:15,589 INFO L93 Difference]: Finished difference Result 755 states and 981 transitions. [2024-11-27 23:40:15,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 23:40:15,589 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 151 [2024-11-27 23:40:15,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:40:15,592 INFO L225 Difference]: With dead ends: 755 [2024-11-27 23:40:15,592 INFO L226 Difference]: Without dead ends: 755 [2024-11-27 23:40:15,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-27 23:40:15,593 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 598 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:40:15,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 1226 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-27 23:40:15,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2024-11-27 23:40:15,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 503. [2024-11-27 23:40:15,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 429 states have (on average 1.641025641025641) internal successors, (704), 479 states have internal predecessors, (704), 17 states have call successors, (17), 5 states have call predecessors, (17), 7 states have return successors, (28), 18 states have call predecessors, (28), 17 states have call successors, (28) [2024-11-27 23:40:15,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 749 transitions. [2024-11-27 23:40:15,612 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 749 transitions. Word has length 151 [2024-11-27 23:40:15,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:40:15,612 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 749 transitions. [2024-11-27 23:40:15,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-27 23:40:15,613 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 749 transitions. [2024-11-27 23:40:15,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-27 23:40:15,614 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:40:15,615 INFO L218 NwaCegarLoop]: trace histogram [42, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:40:15,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-27 23:40:15,615 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-27 23:40:15,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:40:15,616 INFO L85 PathProgramCache]: Analyzing trace with hash -805288408, now seen corresponding path program 1 times [2024-11-27 23:40:15,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:40:15,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340875777] [2024-11-27 23:40:15,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:40:15,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:40:15,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:40:17,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 0 proven. 386 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2024-11-27 23:40:17,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:40:17,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340875777] [2024-11-27 23:40:17,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340875777] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:40:17,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915184340] [2024-11-27 23:40:17,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:40:17,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:40:17,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:40:17,441 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:40:17,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-27 23:40:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:40:18,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 1424 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-27 23:40:18,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:40:21,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-27 23:40:21,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-27 23:40:21,727 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:40:21,728 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-27 23:40:21,734 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:40:21,735 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-27 23:40:21,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 0 proven. 386 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2024-11-27 23:40:21,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:40:22,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-11-27 23:40:22,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:40:22,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:40:22,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:40:22,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:40:22,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:40:22,733 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 27 treesize of output 31 [2024-11-27 23:40:24,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 0 proven. 386 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2024-11-27 23:40:24,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915184340] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:40:24,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:40:24,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 46 [2024-11-27 23:40:24,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918166928] [2024-11-27 23:40:24,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:40:24,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-27 23:40:24,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:40:24,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-27 23:40:24,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1964, Unknown=0, NotChecked=0, Total=2162 [2024-11-27 23:40:24,841 INFO L87 Difference]: Start difference. First operand 503 states and 749 transitions. Second operand has 47 states, 40 states have (on average 4.725) internal successors, (189), 41 states have internal predecessors, (189), 9 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-27 23:40:30,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:40:30,082 INFO L93 Difference]: Finished difference Result 678 states and 935 transitions. [2024-11-27 23:40:30,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-27 23:40:30,083 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 40 states have (on average 4.725) internal successors, (189), 41 states have internal predecessors, (189), 9 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) Word has length 151 [2024-11-27 23:40:30,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:40:30,085 INFO L225 Difference]: With dead ends: 678 [2024-11-27 23:40:30,085 INFO L226 Difference]: Without dead ends: 678 [2024-11-27 23:40:30,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 979 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=440, Invalid=3982, Unknown=0, NotChecked=0, Total=4422 [2024-11-27 23:40:30,088 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 2133 mSDsluCounter, 2997 mSDsCounter, 0 mSdLazyCounter, 1978 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2133 SdHoareTripleChecker+Valid, 3164 SdHoareTripleChecker+Invalid, 2039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:40:30,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2133 Valid, 3164 Invalid, 2039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1978 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-27 23:40:30,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2024-11-27 23:40:30,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 590. [2024-11-27 23:40:30,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 516 states have (on average 1.6666666666666667) internal successors, (860), 566 states have internal predecessors, (860), 17 states have call successors, (17), 5 states have call predecessors, (17), 7 states have return successors, (28), 18 states have call predecessors, (28), 17 states have call successors, (28) [2024-11-27 23:40:30,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 905 transitions. [2024-11-27 23:40:30,103 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 905 transitions. Word has length 151 [2024-11-27 23:40:30,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:40:30,103 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 905 transitions. [2024-11-27 23:40:30,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 40 states have (on average 4.725) internal successors, (189), 41 states have internal predecessors, (189), 9 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-27 23:40:30,104 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 905 transitions. [2024-11-27 23:40:30,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-27 23:40:30,104 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:40:30,105 INFO L218 NwaCegarLoop]: trace histogram [42, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:40:30,121 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-27 23:40:30,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-27 23:40:30,305 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-27 23:40:30,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:40:30,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1340303270, now seen corresponding path program 1 times [2024-11-27 23:40:30,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:40:30,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163686009] [2024-11-27 23:40:30,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:40:30,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:40:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:40:33,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 0 proven. 386 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2024-11-27 23:40:33,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:40:33,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163686009] [2024-11-27 23:40:33,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163686009] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:40:33,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796157427] [2024-11-27 23:40:33,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:40:33,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:40:33,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:40:33,611 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:40:33,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-27 23:40:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:40:34,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 1445 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-27 23:40:34,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:40:36,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 23:40:37,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 27 treesize of output 15 [2024-11-27 23:40:37,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-27 23:40:37,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-27 23:40:37,456 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:40:37,457 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-27 23:40:37,464 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:40:37,464 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-27 23:40:37,666 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 21 treesize of output 9 [2024-11-27 23:40:37,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1248 trivial. 0 not checked. [2024-11-27 23:40:37,678 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:40:37,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796157427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:40:37,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 23:40:37,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [17] total 28 [2024-11-27 23:40:37,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294760274] [2024-11-27 23:40:37,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:40:37,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-27 23:40:37,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:40:37,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-27 23:40:37,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=729, Unknown=0, NotChecked=0, Total=812 [2024-11-27 23:40:37,680 INFO L87 Difference]: Start difference. First operand 590 states and 905 transitions. Second operand has 15 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-27 23:40:41,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:40:41,317 INFO L93 Difference]: Finished difference Result 907 states and 1259 transitions. [2024-11-27 23:40:41,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-27 23:40:41,318 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 154 [2024-11-27 23:40:41,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:40:41,320 INFO L225 Difference]: With dead ends: 907 [2024-11-27 23:40:41,321 INFO L226 Difference]: Without dead ends: 907 [2024-11-27 23:40:41,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=158, Invalid=1402, Unknown=0, NotChecked=0, Total=1560 [2024-11-27 23:40:41,321 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 1088 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1088 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-27 23:40:41,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1088 Valid, 1742 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-27 23:40:41,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2024-11-27 23:40:41,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 675. [2024-11-27 23:40:41,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 602 states have (on average 1.6794019933554818) internal successors, (1011), 651 states have internal predecessors, (1011), 17 states have call successors, (17), 5 states have call predecessors, (17), 7 states have return successors, (28), 18 states have call predecessors, (28), 17 states have call successors, (28) [2024-11-27 23:40:41,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 1056 transitions. [2024-11-27 23:40:41,345 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 1056 transitions. Word has length 154 [2024-11-27 23:40:41,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:40:41,346 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 1056 transitions. [2024-11-27 23:40:41,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-27 23:40:41,346 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 1056 transitions. [2024-11-27 23:40:41,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-27 23:40:41,347 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:40:41,348 INFO L218 NwaCegarLoop]: trace histogram [42, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:40:41,368 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-27 23:40:41,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-27 23:40:41,548 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting l0_destroyErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-27 23:40:41,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:40:41,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1340303271, now seen corresponding path program 1 times [2024-11-27 23:40:41,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:40:41,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16994773] [2024-11-27 23:40:41,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:40:41,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:40:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:40:46,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 0 proven. 596 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2024-11-27 23:40:46,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:40:46,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16994773] [2024-11-27 23:40:46,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16994773] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:40:46,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148760181] [2024-11-27 23:40:46,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:40:46,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:40:46,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:40:46,500 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:40:46,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-27 23:40:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:40:47,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 1445 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-11-27 23:40:47,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:40:50,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 23:40:50,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 23:40:50,466 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 35 treesize of output 23 [2024-11-27 23:40:50,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2024-11-27 23:40:50,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-27 23:40:50,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-27 23:40:50,801 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:40:50,801 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2024-11-27 23:40:50,810 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:40:50,811 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2024-11-27 23:40:51,143 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 29 treesize of output 17 [2024-11-27 23:40:51,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-11-27 23:40:51,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 88 proven. 298 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2024-11-27 23:40:51,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:40:51,980 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 112 treesize of output 104 [2024-11-27 23:40:51,984 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 146 treesize of output 130 [2024-11-27 23:40:52,047 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 64 treesize of output 60 [2024-11-27 23:40:52,059 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 98 treesize of output 90 [2024-11-27 23:41:26,244 INFO L349 Elim1Store]: treesize reduction 11, result has 89.5 percent of original size [2024-11-27 23:41:26,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1307 treesize of output 1358 [2024-11-27 23:41:26,958 INFO L349 Elim1Store]: treesize reduction 11, result has 89.5 percent of original size [2024-11-27 23:41:26,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 2827 treesize of output 2764 [2024-11-27 23:43:33,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:43:33,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:43:34,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-27 23:43:45,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 88 proven. 298 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2024-11-27 23:43:45,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148760181] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:43:45,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:43:45,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 20] total 56 [2024-11-27 23:43:45,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255151795] [2024-11-27 23:43:45,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:43:45,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-27 23:43:45,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:43:45,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-27 23:43:45,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=2948, Unknown=7, NotChecked=0, Total=3192 [2024-11-27 23:43:45,158 INFO L87 Difference]: Start difference. First operand 675 states and 1056 transitions. Second operand has 57 states, 49 states have (on average 4.040816326530612) internal successors, (198), 50 states have internal predecessors, (198), 12 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-27 23:43:57,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:43:57,769 INFO L93 Difference]: Finished difference Result 880 states and 1247 transitions. [2024-11-27 23:43:57,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-27 23:43:57,770 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 49 states have (on average 4.040816326530612) internal successors, (198), 50 states have internal predecessors, (198), 12 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) Word has length 154 [2024-11-27 23:43:57,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:43:57,773 INFO L225 Difference]: With dead ends: 880 [2024-11-27 23:43:57,773 INFO L226 Difference]: Without dead ends: 880 [2024-11-27 23:43:57,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1490 ImplicationChecksByTransitivity, 49.9s TimeCoverageRelationStatistics Valid=604, Invalid=6361, Unknown=7, NotChecked=0, Total=6972 [2024-11-27 23:43:57,774 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 2390 mSDsluCounter, 3781 mSDsCounter, 0 mSdLazyCounter, 2878 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2390 SdHoareTripleChecker+Valid, 3942 SdHoareTripleChecker+Invalid, 2914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-11-27 23:43:57,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2390 Valid, 3942 Invalid, 2914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2878 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2024-11-27 23:43:57,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2024-11-27 23:43:57,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 746. [2024-11-27 23:43:57,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 673 states have (on average 1.687964338781575) internal successors, (1136), 722 states have internal predecessors, (1136), 17 states have call successors, (17), 5 states have call predecessors, (17), 7 states have return successors, (28), 18 states have call predecessors, (28), 17 states have call successors, (28) [2024-11-27 23:43:57,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1181 transitions. [2024-11-27 23:43:57,800 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1181 transitions. Word has length 154 [2024-11-27 23:43:57,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:43:57,800 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 1181 transitions. [2024-11-27 23:43:57,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 49 states have (on average 4.040816326530612) internal successors, (198), 50 states have internal predecessors, (198), 12 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-27 23:43:57,801 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1181 transitions. [2024-11-27 23:43:57,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-27 23:43:57,803 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:43:57,803 INFO L218 NwaCegarLoop]: trace histogram [42, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:43:57,827 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-27 23:43:58,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:43:58,004 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting l0_destroyErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-27 23:43:58,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:43:58,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1336241166, now seen corresponding path program 1 times [2024-11-27 23:43:58,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:43:58,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511107460] [2024-11-27 23:43:58,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:43:58,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:43:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:43:58,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1248 trivial. 0 not checked. [2024-11-27 23:43:58,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:43:58,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511107460] [2024-11-27 23:43:58,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511107460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:43:58,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:43:58,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 23:43:58,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628791103] [2024-11-27 23:43:58,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:43:58,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 23:43:58,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:43:58,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 23:43:58,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:43:58,446 INFO L87 Difference]: Start difference. First operand 746 states and 1181 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-27 23:43:58,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:43:58,649 INFO L93 Difference]: Finished difference Result 756 states and 1112 transitions. [2024-11-27 23:43:58,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 23:43:58,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 157 [2024-11-27 23:43:58,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:43:58,654 INFO L225 Difference]: With dead ends: 756 [2024-11-27 23:43:58,654 INFO L226 Difference]: Without dead ends: 756 [2024-11-27 23:43:58,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-27 23:43:58,655 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 317 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:43:58,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 1069 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:43:58,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2024-11-27 23:43:58,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 723. [2024-11-27 23:43:58,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 650 states have (on average 1.6353846153846154) internal successors, (1063), 699 states have internal predecessors, (1063), 17 states have call successors, (17), 5 states have call predecessors, (17), 7 states have return successors, (28), 18 states have call predecessors, (28), 17 states have call successors, (28) [2024-11-27 23:43:58,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1108 transitions. [2024-11-27 23:43:58,675 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1108 transitions. Word has length 157 [2024-11-27 23:43:58,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:43:58,675 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 1108 transitions. [2024-11-27 23:43:58,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-27 23:43:58,676 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1108 transitions. [2024-11-27 23:43:58,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-27 23:43:58,677 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:43:58,677 INFO L218 NwaCegarLoop]: trace histogram [42, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:43:58,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-27 23:43:58,678 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting l0_destroyErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, l0_destroyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-27 23:43:58,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:43:58,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1336244079, now seen corresponding path program 1 times [2024-11-27 23:43:58,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:43:58,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119003612] [2024-11-27 23:43:58,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:43:58,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:43:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:44:05,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 1 proven. 688 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2024-11-27 23:44:05,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:44:05,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119003612] [2024-11-27 23:44:05,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119003612] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:44:05,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161271828] [2024-11-27 23:44:05,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:44:05,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:44:05,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:44:05,854 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:44:05,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b90c6c43-f665-4257-ad1b-507d5ecffe1e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-27 23:44:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:44:07,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 1466 conjuncts, 132 conjuncts are in the unsatisfiable core [2024-11-27 23:44:07,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:44:10,689 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-27 23:44:10,690 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 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-27 23:44:15,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-27 23:44:15,704 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-27 23:44:15,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2024-11-27 23:44:15,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 23:44:16,687 INFO L349 Elim1Store]: treesize reduction 67, result has 16.3 percent of original size [2024-11-27 23:44:16,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 35 [2024-11-27 23:44:16,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2024-11-27 23:44:16,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-27 23:44:16,829 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:44:16,831 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:44:16,832 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 3 [2024-11-27 23:44:17,279 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:44:17,280 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 51 [2024-11-27 23:44:17,289 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:44:17,289 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2024-11-27 23:44:17,964 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 31 treesize of output 19 [2024-11-27 23:44:18,581 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-27 23:44:18,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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 16 [2024-11-27 23:44:18,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 1 proven. 688 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2024-11-27 23:44:18,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:44:19,463 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 116 treesize of output 108