./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0234-1.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_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/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_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0234-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/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_44283328-58c1-4df2-9d17-b7ee9c6f1476/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 2e40f9e7b474ba5b84186650c7060a1f3eed5394bab52ac2eaa493135efa417c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 04:25:05,978 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:25:06,095 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 04:25:06,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:25:06,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:25:06,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:25:06,137 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:25:06,138 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:25:06,138 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 04:25:06,139 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 04:25:06,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:25:06,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:25:06,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:25:06,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:25:06,141 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:25:06,142 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:25:06,142 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 04:25:06,142 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 04:25:06,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 04:25:06,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:25:06,142 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 04:25:06,142 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 04:25:06,142 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 04:25:06,142 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:25:06,142 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 04:25:06,142 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 04:25:06,143 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 04:25:06,143 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:25:06,143 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:25:06,143 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:25:06,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:25:06,143 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:25:06,143 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:25:06,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:25:06,143 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:25:06,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:25:06,144 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:25:06,144 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:25:06,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:25:06,144 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:25:06,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:25:06,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 04:25:06,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 04:25:06,146 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:25:06,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:25:06,147 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:25:06,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:25:06,147 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_44283328-58c1-4df2-9d17-b7ee9c6f1476/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 -> 2e40f9e7b474ba5b84186650c7060a1f3eed5394bab52ac2eaa493135efa417c [2024-11-28 04:25:06,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:25:06,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:25:06,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:25:06,540 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:25:06,540 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:25:06,542 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/memsafety/test-0234-1.i [2024-11-28 04:25:09,924 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/data/173a19d12/ca071d15230549adb3797260296d269c/FLAG05d327664 [2024-11-28 04:25:10,307 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:25:10,307 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/sv-benchmarks/c/memsafety/test-0234-1.i [2024-11-28 04:25:10,324 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/data/173a19d12/ca071d15230549adb3797260296d269c/FLAG05d327664 [2024-11-28 04:25:10,348 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/data/173a19d12/ca071d15230549adb3797260296d269c [2024-11-28 04:25:10,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:25:10,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:25:10,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:25:10,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:25:10,360 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:25:10,361 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:25:10" (1/1) ... [2024-11-28 04:25:10,361 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c1ccb58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:25:10, skipping insertion in model container [2024-11-28 04:25:10,362 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:25:10" (1/1) ... [2024-11-28 04:25:10,415 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:25:10,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:25:10,842 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 04:25:10,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:25:10,985 INFO L204 MainTranslator]: Completed translation [2024-11-28 04:25:10,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:25:10 WrapperNode [2024-11-28 04:25:10,986 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:25:10,987 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 04:25:10,987 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 04:25:10,988 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 04:25:10,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:25:10" (1/1) ... [2024-11-28 04:25:11,011 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:25:10" (1/1) ... [2024-11-28 04:25:11,039 INFO L138 Inliner]: procedures = 188, calls = 60, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 203 [2024-11-28 04:25:11,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 04:25:11,040 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 04:25:11,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 04:25:11,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 04:25:11,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:25:10" (1/1) ... [2024-11-28 04:25:11,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:25:10" (1/1) ... [2024-11-28 04:25:11,056 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:25:10" (1/1) ... [2024-11-28 04:25:11,095 INFO L175 MemorySlicer]: Split 32 memory accesses to 3 slices as follows [2, 4, 26]. 81 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-28 04:25:11,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:25:10" (1/1) ... [2024-11-28 04:25:11,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:25:10" (1/1) ... [2024-11-28 04:25:11,108 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:25:10" (1/1) ... [2024-11-28 04:25:11,109 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:25:10" (1/1) ... [2024-11-28 04:25:11,113 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:25:10" (1/1) ... [2024-11-28 04:25:11,115 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:25:10" (1/1) ... [2024-11-28 04:25:11,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:25:10" (1/1) ... [2024-11-28 04:25:11,120 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 04:25:11,120 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 04:25:11,120 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 04:25:11,121 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 04:25:11,122 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:25:10" (1/1) ... [2024-11-28 04:25:11,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:25:11,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:25:11,166 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 04:25:11,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 04:25:11,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 04:25:11,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 04:25:11,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 04:25:11,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 04:25:11,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 04:25:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 04:25:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 04:25:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 04:25:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2024-11-28 04:25:11,203 INFO L138 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2024-11-28 04:25:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 04:25:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-28 04:25:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-28 04:25:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-28 04:25:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 04:25:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 04:25:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 04:25:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 04:25:11,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 04:25:11,373 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 04:25:11,375 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 04:25:12,115 INFO L? ?]: Removed 197 outVars from TransFormulas that were not future-live. [2024-11-28 04:25:12,116 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 04:25:12,133 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 04:25:12,133 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-28 04:25:12,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:25:12 BoogieIcfgContainer [2024-11-28 04:25:12,134 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 04:25:12,137 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 04:25:12,137 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 04:25:12,143 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 04:25:12,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:25:10" (1/3) ... [2024-11-28 04:25:12,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df56759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:25:12, skipping insertion in model container [2024-11-28 04:25:12,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:25:10" (2/3) ... [2024-11-28 04:25:12,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df56759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:25:12, skipping insertion in model container [2024-11-28 04:25:12,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:25:12" (3/3) ... [2024-11-28 04:25:12,146 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0234-1.i [2024-11-28 04:25:12,166 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 04:25:12,168 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0234-1.i that has 2 procedures, 186 locations, 1 initial locations, 11 loop locations, and 75 error locations. [2024-11-28 04:25:12,218 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 04:25:12,235 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;@103a534, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 04:25:12,235 INFO L334 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2024-11-28 04:25:12,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 186 states, 103 states have (on average 1.941747572815534) internal successors, (200), 178 states have internal predecessors, (200), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:25:12,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-28 04:25:12,251 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:25:12,253 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-28 04:25:12,254 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 04:25:12,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:25:12,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1545638, now seen corresponding path program 1 times [2024-11-28 04:25:12,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:25:12,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027102497] [2024-11-28 04:25:12,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:25:12,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:25:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:25:12,434 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-28 04:25:12,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:25:12,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027102497] [2024-11-28 04:25:12,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027102497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:25:12,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:25:12,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:25:12,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675955131] [2024-11-28 04:25:12,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:25:12,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 04:25:12,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:25:12,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 04:25:12,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 04:25:12,481 INFO L87 Difference]: Start difference. First operand has 186 states, 103 states have (on average 1.941747572815534) internal successors, (200), 178 states have internal predecessors, (200), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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-28 04:25:12,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:25:12,523 INFO L93 Difference]: Finished difference Result 186 states and 201 transitions. [2024-11-28 04:25:12,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 04:25:12,528 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-28 04:25:12,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:25:12,538 INFO L225 Difference]: With dead ends: 186 [2024-11-28 04:25:12,538 INFO L226 Difference]: Without dead ends: 184 [2024-11-28 04:25:12,540 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-28 04:25:12,546 INFO L435 NwaCegarLoop]: 201 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, 201 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-28 04:25:12,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:25:12,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-28 04:25:12,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-11-28 04:25:12,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 102 states have (on average 1.8333333333333333) internal successors, (187), 176 states have internal predecessors, (187), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:25:12,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 199 transitions. [2024-11-28 04:25:12,603 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 199 transitions. Word has length 4 [2024-11-28 04:25:12,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:25:12,603 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 199 transitions. [2024-11-28 04:25:12,604 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-28 04:25:12,604 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 199 transitions. [2024-11-28 04:25:12,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 04:25:12,604 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:25:12,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 04:25:12,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 04:25:12,605 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 04:25:12,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:25:12,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1481477601, now seen corresponding path program 1 times [2024-11-28 04:25:12,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:25:12,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279113322] [2024-11-28 04:25:12,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:25:12,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:25:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:25:12,759 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-28 04:25:12,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:25:12,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279113322] [2024-11-28 04:25:12,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279113322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:25:12,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:25:12,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:25:12,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741740053] [2024-11-28 04:25:12,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:25:12,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:25:12,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:25:12,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:25:12,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:25:12,766 INFO L87 Difference]: Start difference. First operand 184 states and 199 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-28 04:25:12,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:25:12,982 INFO L93 Difference]: Finished difference Result 183 states and 198 transitions. [2024-11-28 04:25:12,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:25:12,983 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-28 04:25:12,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:25:12,984 INFO L225 Difference]: With dead ends: 183 [2024-11-28 04:25:12,985 INFO L226 Difference]: Without dead ends: 183 [2024-11-28 04:25:12,985 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-28 04:25:12,986 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 4 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:25:12,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 315 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:25:12,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-28 04:25:12,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2024-11-28 04:25:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 102 states have (on average 1.8235294117647058) internal successors, (186), 175 states have internal predecessors, (186), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:25:12,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 198 transitions. [2024-11-28 04:25:13,000 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 198 transitions. Word has length 6 [2024-11-28 04:25:13,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:25:13,000 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 198 transitions. [2024-11-28 04:25:13,000 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-28 04:25:13,001 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 198 transitions. [2024-11-28 04:25:13,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-28 04:25:13,001 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:25:13,001 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:25:13,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 04:25:13,002 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 04:25:13,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:25:13,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1318834591, now seen corresponding path program 1 times [2024-11-28 04:25:13,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:25:13,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639368537] [2024-11-28 04:25:13,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:25:13,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:25:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-28 04:25:13,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [275925787] [2024-11-28 04:25:13,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:25:13,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:25:13,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:25:13,040 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:25:13,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 04:25:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:25:13,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-28 04:25:13,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:25:13,302 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-28 04:25:13,336 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-28 04:25:13,338 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:25:13,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:25:13,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639368537] [2024-11-28 04:25:13,339 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-28 04:25:13,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275925787] [2024-11-28 04:25:13,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275925787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:25:13,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:25:13,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:25:13,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450572652] [2024-11-28 04:25:13,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:25:13,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:25:13,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:25:13,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:25:13,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:25:13,343 INFO L87 Difference]: Start difference. First operand 183 states and 198 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-28 04:25:13,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:25:13,587 INFO L93 Difference]: Finished difference Result 192 states and 207 transitions. [2024-11-28 04:25:13,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:25:13,587 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-28 04:25:13,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:25:13,589 INFO L225 Difference]: With dead ends: 192 [2024-11-28 04:25:13,589 INFO L226 Difference]: Without dead ends: 192 [2024-11-28 04:25:13,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-28 04:25:13,590 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 11 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:25:13,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 505 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:25:13,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-28 04:25:13,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2024-11-28 04:25:13,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 110 states have (on average 1.7727272727272727) internal successors, (195), 183 states have internal predecessors, (195), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:25:13,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 207 transitions. [2024-11-28 04:25:13,603 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 207 transitions. Word has length 7 [2024-11-28 04:25:13,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:25:13,603 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 207 transitions. [2024-11-28 04:25:13,603 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-28 04:25:13,604 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 207 transitions. [2024-11-28 04:25:13,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-28 04:25:13,605 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:25:13,606 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-28 04:25:13,617 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 04:25:13,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:25:13,810 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 04:25:13,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:25:13,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1179472132, now seen corresponding path program 1 times [2024-11-28 04:25:13,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:25:13,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847982727] [2024-11-28 04:25:13,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:25:13,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:25:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-28 04:25:13,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [61229054] [2024-11-28 04:25:13,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:25:13,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:25:13,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:25:13,998 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:25:14,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 04:25:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:25:14,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-28 04:25:14,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:25:14,330 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-28 04:25:14,408 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-28 04:25:14,508 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-28 04:25:14,508 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:25:14,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:25:14,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847982727] [2024-11-28 04:25:14,509 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-28 04:25:14,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61229054] [2024-11-28 04:25:14,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61229054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:25:14,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:25:14,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:25:14,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079472731] [2024-11-28 04:25:14,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:25:14,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:25:14,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:25:14,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:25:14,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:25:14,511 INFO L87 Difference]: Start difference. First operand 192 states and 207 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-28 04:25:14,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:25:14,731 INFO L93 Difference]: Finished difference Result 204 states and 219 transitions. [2024-11-28 04:25:14,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:25:14,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2024-11-28 04:25:14,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:25:14,733 INFO L225 Difference]: With dead ends: 204 [2024-11-28 04:25:14,733 INFO L226 Difference]: Without dead ends: 194 [2024-11-28 04:25:14,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:25:14,734 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 3 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:25:14,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 694 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:25:14,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-28 04:25:14,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2024-11-28 04:25:14,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 112 states have (on average 1.7589285714285714) internal successors, (197), 185 states have internal predecessors, (197), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:25:14,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 209 transitions. [2024-11-28 04:25:14,746 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 209 transitions. Word has length 66 [2024-11-28 04:25:14,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:25:14,747 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 209 transitions. [2024-11-28 04:25:14,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-28 04:25:14,747 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 209 transitions. [2024-11-28 04:25:14,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-28 04:25:14,749 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:25:14,749 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-28 04:25:14,761 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-28 04:25:14,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:25:14,953 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 04:25:14,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:25:14,953 INFO L85 PathProgramCache]: Analyzing trace with hash 255795740, now seen corresponding path program 1 times [2024-11-28 04:25:14,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:25:14,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113442145] [2024-11-28 04:25:14,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:25:14,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:25:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-28 04:25:15,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1379105923] [2024-11-28 04:25:15,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:25:15,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:25:15,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:25:15,381 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:25:15,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 04:25:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:25:15,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-28 04:25:15,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:25:15,876 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-28 04:25:15,945 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-28 04:25:16,104 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 51 proven. 1 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-28 04:25:16,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:25:16,513 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-28 04:25:16,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:25:16,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113442145] [2024-11-28 04:25:16,516 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-28 04:25:16,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379105923] [2024-11-28 04:25:16,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379105923] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:25:16,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:25:16,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-28 04:25:16,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935235549] [2024-11-28 04:25:16,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:25:16,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 04:25:16,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:25:16,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 04:25:16,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:25:16,519 INFO L87 Difference]: Start difference. First operand 194 states and 209 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-28 04:25:17,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:25:17,091 INFO L93 Difference]: Finished difference Result 213 states and 229 transitions. [2024-11-28 04:25:17,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 04:25:17,092 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 71 [2024-11-28 04:25:17,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:25:17,093 INFO L225 Difference]: With dead ends: 213 [2024-11-28 04:25:17,093 INFO L226 Difference]: Without dead ends: 198 [2024-11-28 04:25:17,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2024-11-28 04:25:17,094 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 22 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:25:17,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 702 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 04:25:17,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-28 04:25:17,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-11-28 04:25:17,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 116 states have (on average 1.7327586206896552) internal successors, (201), 189 states have internal predecessors, (201), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:25:17,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 213 transitions. [2024-11-28 04:25:17,104 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 213 transitions. Word has length 71 [2024-11-28 04:25:17,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:25:17,104 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 213 transitions. [2024-11-28 04:25:17,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-28 04:25:17,105 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 213 transitions. [2024-11-28 04:25:17,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-28 04:25:17,107 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:25:17,107 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-28 04:25:17,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 04:25:17,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:25:17,311 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 04:25:17,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:25:17,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1055543044, now seen corresponding path program 2 times [2024-11-28 04:25:17,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:25:17,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513200209] [2024-11-28 04:25:17,311 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:25:17,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:25:17,603 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:25:17,603 INFO L230 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-28 04:25:17,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1666831952] [2024-11-28 04:25:17,616 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:25:17,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:25:17,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:25:17,618 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:25:17,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 04:25:18,221 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:25:18,221 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:25:18,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-28 04:25:18,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:25:18,308 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-28 04:25:18,367 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-28 04:25:18,596 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 255 proven. 56 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-28 04:25:18,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:25:19,080 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-28 04:25:19,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:25:19,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513200209] [2024-11-28 04:25:19,080 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-28 04:25:19,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666831952] [2024-11-28 04:25:19,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666831952] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:25:19,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:25:19,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-11-28 04:25:19,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292951747] [2024-11-28 04:25:19,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:25:19,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-28 04:25:19,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:25:19,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-28 04:25:19,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2024-11-28 04:25:19,085 INFO L87 Difference]: Start difference. First operand 198 states and 213 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-28 04:25:20,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:25:20,208 INFO L93 Difference]: Finished difference Result 220 states and 239 transitions. [2024-11-28 04:25:20,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-28 04:25:20,209 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-28 04:25:20,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:25:20,210 INFO L225 Difference]: With dead ends: 220 [2024-11-28 04:25:20,210 INFO L226 Difference]: Without dead ends: 205 [2024-11-28 04:25:20,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2024-11-28 04:25:20,212 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 24 mSDsluCounter, 1958 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 2150 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:25:20,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 2150 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 04:25:20,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-28 04:25:20,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-11-28 04:25:20,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 123 states have (on average 1.6910569105691058) internal successors, (208), 196 states have internal predecessors, (208), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:25:20,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 220 transitions. [2024-11-28 04:25:20,238 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 220 transitions. Word has length 86 [2024-11-28 04:25:20,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:25:20,238 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 220 transitions. [2024-11-28 04:25:20,238 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-28 04:25:20,239 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 220 transitions. [2024-11-28 04:25:20,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-28 04:25:20,245 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:25:20,246 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-28 04:25:20,274 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 04:25:20,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-28 04:25:20,447 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 04:25:20,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:25:20,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1143950596, now seen corresponding path program 3 times [2024-11-28 04:25:20,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:25:20,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419309911] [2024-11-28 04:25:20,447 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 04:25:20,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:25:21,434 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2024-11-28 04:25:21,434 INFO L230 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-28 04:25:21,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1506263999] [2024-11-28 04:25:21,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 04:25:21,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:25:21,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:25:21,459 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:25:21,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 04:25:21,786 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-28 04:25:21,786 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:25:21,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-28 04:25:21,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:25:21,848 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-28 04:25:21,876 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-28 04:25:21,876 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:25:21,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:25:21,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419309911] [2024-11-28 04:25:21,877 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-28 04:25:21,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506263999] [2024-11-28 04:25:21,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506263999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:25:21,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:25:21,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:25:21,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90845887] [2024-11-28 04:25:21,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:25:21,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:25:21,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:25:21,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:25:21,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:25:21,885 INFO L87 Difference]: Start difference. First operand 205 states and 220 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-28 04:25:22,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:25:22,064 INFO L93 Difference]: Finished difference Result 204 states and 219 transitions. [2024-11-28 04:25:22,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:25:22,068 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-28 04:25:22,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:25:22,070 INFO L225 Difference]: With dead ends: 204 [2024-11-28 04:25:22,070 INFO L226 Difference]: Without dead ends: 204 [2024-11-28 04:25:22,070 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-28 04:25:22,071 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 11 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:25:22,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 527 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:25:22,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-28 04:25:22,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-11-28 04:25:22,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 123 states have (on average 1.6829268292682926) internal successors, (207), 195 states have internal predecessors, (207), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:25:22,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 219 transitions. [2024-11-28 04:25:22,082 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 219 transitions. Word has length 106 [2024-11-28 04:25:22,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:25:22,083 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 219 transitions. [2024-11-28 04:25:22,083 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-28 04:25:22,084 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 219 transitions. [2024-11-28 04:25:22,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-28 04:25:22,087 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:25:22,087 INFO L218 NwaCegarLoop]: trace histogram [45, 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-28 04:25:22,100 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 04:25:22,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:25:22,289 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 04:25:22,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:25:22,289 INFO L85 PathProgramCache]: Analyzing trace with hash 363069536, now seen corresponding path program 1 times [2024-11-28 04:25:22,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:25:22,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706087653] [2024-11-28 04:25:22,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:25:22,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:25:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:25:24,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 601 proven. 61 refuted. 0 times theorem prover too weak. 733 trivial. 0 not checked. [2024-11-28 04:25:24,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:25:24,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706087653] [2024-11-28 04:25:24,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706087653] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:25:24,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034278580] [2024-11-28 04:25:24,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:25:24,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:25:24,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:25:24,229 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:25:24,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 04:25:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:25:24,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 1204 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-28 04:25:24,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:25:24,892 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-28 04:25:24,987 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 04:25:24,987 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-28 04:25:25,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 601 proven. 1 refuted. 0 times theorem prover too weak. 733 trivial. 60 not checked. [2024-11-28 04:25:25,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:25:25,416 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 04:25:25,416 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-28 04:25:25,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 601 proven. 61 refuted. 0 times theorem prover too weak. 733 trivial. 0 not checked. [2024-11-28 04:25:25,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034278580] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:25:25,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:25:25,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 16 [2024-11-28 04:25:25,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136351430] [2024-11-28 04:25:25,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:25:25,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 04:25:25,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:25:25,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 04:25:25,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=198, Unknown=1, NotChecked=28, Total=272 [2024-11-28 04:25:25,461 INFO L87 Difference]: Start difference. First operand 204 states and 219 transitions. Second operand has 17 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 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-28 04:25:26,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:25:26,180 INFO L93 Difference]: Finished difference Result 202 states and 217 transitions. [2024-11-28 04:25:26,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:25:26,181 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 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 118 [2024-11-28 04:25:26,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:25:26,184 INFO L225 Difference]: With dead ends: 202 [2024-11-28 04:25:26,184 INFO L226 Difference]: Without dead ends: 202 [2024-11-28 04:25:26,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 228 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=310, Unknown=1, NotChecked=36, Total=420 [2024-11-28 04:25:26,185 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 13 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 187 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:25:26,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1228 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 689 Invalid, 0 Unknown, 187 Unchecked, 0.6s Time] [2024-11-28 04:25:26,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-28 04:25:26,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2024-11-28 04:25:26,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 123 states have (on average 1.6666666666666667) internal successors, (205), 193 states have internal predecessors, (205), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:25:26,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 217 transitions. [2024-11-28 04:25:26,198 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 217 transitions. Word has length 118 [2024-11-28 04:25:26,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:25:26,199 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 217 transitions. [2024-11-28 04:25:26,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 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-28 04:25:26,199 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 217 transitions. [2024-11-28 04:25:26,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-28 04:25:26,206 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:25:26,206 INFO L218 NwaCegarLoop]: trace histogram [45, 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-28 04:25:26,220 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 04:25:26,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-28 04:25:26,407 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 04:25:26,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:25:26,408 INFO L85 PathProgramCache]: Analyzing trace with hash 363069537, now seen corresponding path program 1 times [2024-11-28 04:25:26,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:25:26,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960741419] [2024-11-28 04:25:26,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:25:26,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:25:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:25:30,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 601 proven. 97 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2024-11-28 04:25:30,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:25:30,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960741419] [2024-11-28 04:25:30,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960741419] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:25:30,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047165283] [2024-11-28 04:25:30,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:25:30,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:25:30,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:25:30,330 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:25:30,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 04:25:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:25:33,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 1204 conjuncts, 90 conjuncts are in the unsatisfiable core [2024-11-28 04:25:33,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:25:34,117 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-28 04:25:41,765 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-28 04:25:41,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:25:41,913 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-28 04:25:41,939 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:25:41,939 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-28 04:25:42,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 419 proven. 526 refuted. 0 times theorem prover too weak. 305 trivial. 145 not checked. [2024-11-28 04:25:42,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:25:42,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047165283] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:25:42,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:25:42,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 27] total 45 [2024-11-28 04:25:42,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971661260] [2024-11-28 04:25:42,429 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:25:42,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-28 04:25:42,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:25:42,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-28 04:25:42,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2013, Unknown=2, NotChecked=90, Total=2256 [2024-11-28 04:25:42,433 INFO L87 Difference]: Start difference. First operand 202 states and 217 transitions. Second operand has 46 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 41 states have internal predecessors, (82), 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-28 04:25:46,529 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-28 04:25:52,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:25:52,978 INFO L93 Difference]: Finished difference Result 208 states and 226 transitions. [2024-11-28 04:25:52,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-28 04:25:52,978 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 41 states have internal predecessors, (82), 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 118 [2024-11-28 04:25:52,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:25:52,981 INFO L225 Difference]: With dead ends: 208 [2024-11-28 04:25:52,982 INFO L226 Difference]: Without dead ends: 208 [2024-11-28 04:25:52,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=296, Invalid=3488, Unknown=2, NotChecked=120, Total=3906 [2024-11-28 04:25:52,985 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 32 mSDsluCounter, 2885 mSDsCounter, 0 mSdLazyCounter, 2289 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 3060 SdHoareTripleChecker+Invalid, 2490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2289 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 185 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:25:52,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 3060 Invalid, 2490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2289 Invalid, 1 Unknown, 185 Unchecked, 8.5s Time] [2024-11-28 04:25:52,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-28 04:25:52,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 200. [2024-11-28 04:25:52,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 123 states have (on average 1.6504065040650406) internal successors, (203), 191 states have internal predecessors, (203), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:25:52,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 215 transitions. [2024-11-28 04:25:52,994 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 215 transitions. Word has length 118 [2024-11-28 04:25:52,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:25:52,994 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 215 transitions. [2024-11-28 04:25:52,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 41 states have internal predecessors, (82), 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-28 04:25:52,995 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 215 transitions. [2024-11-28 04:25:52,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-28 04:25:52,996 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:25:52,997 INFO L218 NwaCegarLoop]: trace histogram [45, 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-28 04:25:53,032 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 04:25:53,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:25:53,197 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 04:25:53,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:25:53,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1017473985, now seen corresponding path program 1 times [2024-11-28 04:25:53,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:25:53,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167332057] [2024-11-28 04:25:53,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:25:53,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:25:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:25:55,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 776 proven. 153 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2024-11-28 04:25:55,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:25:55,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167332057] [2024-11-28 04:25:55,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167332057] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:25:55,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255300755] [2024-11-28 04:25:55,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:25:55,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:25:55,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:25:55,284 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:25:55,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 04:25:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:25:55,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 1221 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-28 04:25:55,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:25:56,110 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-28 04:25:56,187 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 04:25:56,187 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-28 04:25:56,316 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 04:25:56,316 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-28 04:25:56,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 719 proven. 2 refuted. 0 times theorem prover too weak. 527 trivial. 147 not checked. [2024-11-28 04:25:56,350 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:25:57,149 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 04:25:57,150 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-28 04:25:57,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 719 proven. 149 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2024-11-28 04:25:57,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255300755] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:25:57,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:25:57,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 11] total 23 [2024-11-28 04:25:57,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721248264] [2024-11-28 04:25:57,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:25:57,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 04:25:57,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:25:57,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 04:25:57,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=443, Unknown=1, NotChecked=42, Total=552 [2024-11-28 04:25:57,183 INFO L87 Difference]: Start difference. First operand 200 states and 215 transitions. Second operand has 24 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 21 states have internal predecessors, (76), 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-28 04:25:58,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:25:58,517 INFO L93 Difference]: Finished difference Result 197 states and 212 transitions. [2024-11-28 04:25:58,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 04:25:58,518 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 21 states have internal predecessors, (76), 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 120 [2024-11-28 04:25:58,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:25:58,519 INFO L225 Difference]: With dead ends: 197 [2024-11-28 04:25:58,519 INFO L226 Difference]: Without dead ends: 197 [2024-11-28 04:25:58,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 230 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=104, Invalid=655, Unknown=1, NotChecked=52, Total=812 [2024-11-28 04:25:58,520 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 27 mSDsluCounter, 1700 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1867 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 182 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:25:58,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1867 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1239 Invalid, 0 Unknown, 182 Unchecked, 1.1s Time] [2024-11-28 04:25:58,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-28 04:25:58,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2024-11-28 04:25:58,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 123 states have (on average 1.6260162601626016) internal successors, (200), 188 states have internal predecessors, (200), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:25:58,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 212 transitions. [2024-11-28 04:25:58,528 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 212 transitions. Word has length 120 [2024-11-28 04:25:58,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:25:58,529 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 212 transitions. [2024-11-28 04:25:58,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 21 states have internal predecessors, (76), 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-28 04:25:58,529 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 212 transitions. [2024-11-28 04:25:58,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-28 04:25:58,531 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:25:58,531 INFO L218 NwaCegarLoop]: trace histogram [45, 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-28 04:25:58,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-28 04:25:58,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-28 04:25:58,735 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 04:25:58,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:25:58,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1017473986, now seen corresponding path program 1 times [2024-11-28 04:25:58,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:25:58,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502517694] [2024-11-28 04:25:58,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:25:58,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:25:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:26:03,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 719 proven. 246 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2024-11-28 04:26:03,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:26:03,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502517694] [2024-11-28 04:26:03,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502517694] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:26:03,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203815755] [2024-11-28 04:26:03,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:26:03,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:26:03,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:26:03,407 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:26:03,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 04:26:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:26:05,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 1221 conjuncts, 134 conjuncts are in the unsatisfiable core [2024-11-28 04:26:05,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:26:05,930 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-28 04:27:52,698 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-28 04:27:52,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:27:52,942 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-28 04:27:52,982 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 04:27:52,983 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-28 04:27:53,093 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-28 04:27:53,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:27:53,239 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-28 04:27:53,270 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:27:53,270 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-28 04:27:53,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 251 proven. 495 refuted. 0 times theorem prover too weak. 109 trivial. 540 not checked. [2024-11-28 04:27:53,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:27:53,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203815755] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:27:53,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:27:53,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 31] total 52 [2024-11-28 04:27:53,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523134368] [2024-11-28 04:27:53,922 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:27:53,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-28 04:27:53,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:27:53,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-28 04:27:53,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2579, Unknown=27, NotChecked=206, Total=2970 [2024-11-28 04:27:53,926 INFO L87 Difference]: Start difference. First operand 197 states and 212 transitions. Second operand has 53 states, 52 states have (on average 2.076923076923077) internal successors, (108), 50 states have internal predecessors, (108), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-28 04:27:58,049 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-28 04:28:06,290 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-28 04:28:10,339 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-28 04:28:14,817 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-28 04:28:23,278 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-28 04:28:31,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-28 04:28:36,140 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-28 04:28:39,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-28 04:28:43,868 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-28 04:28:54,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-28 04:28:59,766 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-28 04:29:04,862 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-28 04:29:18,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:29:18,680 INFO L93 Difference]: Finished difference Result 209 states and 229 transitions. [2024-11-28 04:29:18,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-28 04:29:18,681 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.076923076923077) internal successors, (108), 50 states have internal predecessors, (108), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 3 states have call successors, (9) Word has length 120 [2024-11-28 04:29:18,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:29:18,682 INFO L225 Difference]: With dead ends: 209 [2024-11-28 04:29:18,682 INFO L226 Difference]: Without dead ends: 209 [2024-11-28 04:29:18,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1093 ImplicationChecksByTransitivity, 138.4s TimeCoverageRelationStatistics Valid=390, Invalid=4987, Unknown=33, NotChecked=290, Total=5700 [2024-11-28 04:29:18,689 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 71 mSDsluCounter, 3136 mSDsCounter, 0 mSdLazyCounter, 2666 mSolverCounterSat, 14 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 3300 SdHoareTripleChecker+Invalid, 3051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2666 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 360 IncrementalHoareTripleChecker+Unchecked, 54.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:29:18,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 3300 Invalid, 3051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2666 Invalid, 11 Unknown, 360 Unchecked, 54.1s Time] [2024-11-28 04:29:18,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-28 04:29:18,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 194. [2024-11-28 04:29:18,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 123 states have (on average 1.6016260162601625) internal successors, (197), 185 states have internal predecessors, (197), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:29:18,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 209 transitions. [2024-11-28 04:29:18,703 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 209 transitions. Word has length 120 [2024-11-28 04:29:18,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:29:18,704 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 209 transitions. [2024-11-28 04:29:18,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.076923076923077) internal successors, (108), 50 states have internal predecessors, (108), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-28 04:29:18,705 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 209 transitions. [2024-11-28 04:29:18,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-28 04:29:18,706 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:29:18,707 INFO L218 NwaCegarLoop]: trace histogram [45, 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-28 04:29:18,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 04:29:18,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:29:18,907 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 04:29:18,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:29:18,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1072582067, now seen corresponding path program 1 times [2024-11-28 04:29:18,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:29:18,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371575368] [2024-11-28 04:29:18,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:29:18,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:29:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:29:21,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 773 proven. 245 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2024-11-28 04:29:21,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:29:21,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371575368] [2024-11-28 04:29:21,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371575368] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:29:21,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106248534] [2024-11-28 04:29:21,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:29:21,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:29:21,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:29:21,959 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:29:21,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 04:29:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:29:22,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 1266 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-28 04:29:22,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:29:22,894 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-28 04:29:22,898 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-28 04:29:22,925 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-28 04:29:22,928 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-28 04:29:22,957 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-28 04:29:22,962 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-28 04:29:23,176 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-28 04:29:23,182 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-28 04:29:23,288 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-28 04:29:23,295 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-28 04:29:23,396 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-28 04:29:23,509 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 04:29:23,510 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-28 04:29:23,727 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-28 04:29:23,734 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-28 04:29:23,990 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-28 04:29:23,996 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-28 04:29:24,393 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-28 04:29:24,404 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-28 04:29:25,088 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((v_ArrVal_3799 Int)) (= (select |c_#valid| v_ArrVal_3799) 1))) (.cse4 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (and (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)))) .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) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|)) (.cse3 (@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| .cse2 (select |v_old(#valid)_AFTER_CALL_51| .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| .cse3 (select |v_old(#valid)_AFTER_CALL_52| .cse3)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse2) 1) (= (select |c_#valid| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (and .cse1 (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-28 04:29:25,097 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((v_ArrVal_3799 Int)) (= (select |c_#valid| v_ArrVal_3799) 1))) (.cse4 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (and (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)))) .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) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|)) (.cse3 (@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| .cse2 (select |v_old(#valid)_AFTER_CALL_51| .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| .cse3 (select |v_old(#valid)_AFTER_CALL_52| .cse3)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse2) 1) (= (select |c_#valid| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (and .cse1 (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-28 04:29:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 659 proven. 179 refuted. 0 times theorem prover too weak. 377 trivial. 180 not checked. [2024-11-28 04:29:25,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:29:25,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106248534] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:29:25,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:29:25,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 33 [2024-11-28 04:29:25,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561824754] [2024-11-28 04:29:25,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:29:25,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-28 04:29:25,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:29:25,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-28 04:29:25,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=624, Unknown=19, NotChecked=590, Total=1332 [2024-11-28 04:29:25,582 INFO L87 Difference]: Start difference. First operand 194 states and 209 transitions. Second operand has 34 states, 31 states have (on average 2.6774193548387095) internal successors, (83), 27 states have internal predecessors, (83), 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-28 04:29:26,257 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-28 04:29:26,260 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-28 04:29:26,265 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-28 04:29:26,269 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-28 04:29:26,274 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-28 04:29:26,277 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-28 04:29:26,311 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-28 04:29:26,317 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-28 04:29:26,340 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-28 04:29:26,347 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-28 04:29:26,491 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-28 04:29:26,497 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-28 04:29:26,648 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-28 04:29:26,655 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-28 04:29:26,766 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-28 04:29:26,772 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-28 04:29:26,904 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (let ((.cse1 (exists ((v_ArrVal_3799 Int)) (= (select |c_#valid| v_ArrVal_3799) 1))) (.cse4 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (and (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)))) .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) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|)) (.cse3 (@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| .cse2 (select |v_old(#valid)_AFTER_CALL_51| .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| .cse3 (select |v_old(#valid)_AFTER_CALL_52| .cse3)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse2) 1) (= (select |c_#valid| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (and .cse1 (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 .cse5) (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)))) .cse4))) .cse5)) is different from false [2024-11-28 04:29:26,910 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (let ((.cse1 (exists ((v_ArrVal_3799 Int)) (= (select |c_#valid| v_ArrVal_3799) 1))) (.cse4 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (and (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)))) .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) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|)) (.cse3 (@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| .cse2 (select |v_old(#valid)_AFTER_CALL_51| .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| .cse3 (select |v_old(#valid)_AFTER_CALL_52| .cse3)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse2) 1) (= (select |c_#valid| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (and .cse1 (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 .cse5) (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)))) .cse4))) .cse5)) is different from true [2024-11-28 04:29:28,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:29:28,785 INFO L93 Difference]: Finished difference Result 213 states and 234 transitions. [2024-11-28 04:29:28,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 04:29:28,786 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.6774193548387095) internal successors, (83), 27 states have internal predecessors, (83), 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 126 [2024-11-28 04:29:28,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:29:28,787 INFO L225 Difference]: With dead ends: 213 [2024-11-28 04:29:28,787 INFO L226 Difference]: Without dead ends: 213 [2024-11-28 04:29:28,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 129 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=153, Invalid=878, Unknown=37, NotChecked=1482, Total=2550 [2024-11-28 04:29:28,789 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 16 mSDsluCounter, 2043 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2219 SdHoareTripleChecker+Invalid, 4034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2497 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:29:28,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2219 Invalid, 4034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1502 Invalid, 0 Unknown, 2497 Unchecked, 2.2s Time] [2024-11-28 04:29:28,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-28 04:29:28,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-11-28 04:29:28,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 139 states have (on average 1.5539568345323742) internal successors, (216), 201 states have internal predecessors, (216), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-28 04:29:28,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 234 transitions. [2024-11-28 04:29:28,797 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 234 transitions. Word has length 126 [2024-11-28 04:29:28,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:29:28,798 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 234 transitions. [2024-11-28 04:29:28,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.6774193548387095) internal successors, (83), 27 states have internal predecessors, (83), 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-28 04:29:28,798 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 234 transitions. [2024-11-28 04:29:28,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-28 04:29:28,801 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:29:28,801 INFO L218 NwaCegarLoop]: trace histogram [45, 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-28 04:29:28,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-28 04:29:29,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-28 04:29:29,002 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 04:29:29,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:29:29,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1072582066, now seen corresponding path program 1 times [2024-11-28 04:29:29,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:29:29,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607195379] [2024-11-28 04:29:29,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:29:29,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:29:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:29:36,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 659 proven. 483 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-11-28 04:29:36,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:29:36,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607195379] [2024-11-28 04:29:36,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607195379] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:29:36,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710608980] [2024-11-28 04:29:36,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:29:36,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:29:36,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:29:36,322 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:29:36,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 04:29:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:29:39,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 1266 conjuncts, 131 conjuncts are in the unsatisfiable core [2024-11-28 04:29:39,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:29:39,613 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-28 04:30:53,951 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 04:30:53,951 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-28 04:30:53,991 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 04:30:53,991 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-28 04:30:54,751 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-11-28 04:30:54,751 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-28 04:30:54,776 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-28 04:30:55,211 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-28 04:30:55,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:30:55,344 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-28 04:30:55,379 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-28 04:30:55,380 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-28 04:30:55,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 435 proven. 492 refuted. 0 times theorem prover too weak. 243 trivial. 225 not checked. [2024-11-28 04:30:55,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:30:56,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710608980] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:30:56,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:30:56,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 39] total 61 [2024-11-28 04:30:56,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967509206] [2024-11-28 04:30:56,287 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:30:56,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-11-28 04:30:56,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:30:56,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-11-28 04:30:56,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=3669, Unknown=18, NotChecked=122, Total=4032 [2024-11-28 04:30:56,290 INFO L87 Difference]: Start difference. First operand 213 states and 234 transitions. Second operand has 62 states, 58 states have (on average 2.1379310344827585) internal successors, (124), 56 states have internal predecessors, (124), 5 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-28 04:31:00,431 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-28 04:31:03,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-28 04:31:07,747 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-28 04:31:12,341 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-28 04:31:16,660 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-28 04:31:21,276 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-28 04:31:25,607 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-28 04:31:30,191 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-28 04:31:37,568 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-28 04:31:42,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:31:42,525 INFO L93 Difference]: Finished difference Result 215 states and 238 transitions. [2024-11-28 04:31:42,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-28 04:31:42,526 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 58 states have (on average 2.1379310344827585) internal successors, (124), 56 states have internal predecessors, (124), 5 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) Word has length 126 [2024-11-28 04:31:42,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:31:42,528 INFO L225 Difference]: With dead ends: 215 [2024-11-28 04:31:42,528 INFO L226 Difference]: Without dead ends: 215 [2024-11-28 04:31:42,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 82.7s TimeCoverageRelationStatistics Valid=516, Invalid=6780, Unknown=18, NotChecked=168, Total=7482 [2024-11-28 04:31:42,531 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 77 mSDsluCounter, 3128 mSDsCounter, 0 mSdLazyCounter, 3142 mSolverCounterSat, 23 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 3279 SdHoareTripleChecker+Invalid, 3346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 3142 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 41.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:31:42,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 3279 Invalid, 3346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 3142 Invalid, 8 Unknown, 173 Unchecked, 41.3s Time] [2024-11-28 04:31:42,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-28 04:31:42,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 188. [2024-11-28 04:31:42,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 123 states have (on average 1.5528455284552845) internal successors, (191), 179 states have internal predecessors, (191), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:31:42,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 203 transitions. [2024-11-28 04:31:42,540 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 203 transitions. Word has length 126 [2024-11-28 04:31:42,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:31:42,541 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 203 transitions. [2024-11-28 04:31:42,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 58 states have (on average 2.1379310344827585) internal successors, (124), 56 states have internal predecessors, (124), 5 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-28 04:31:42,541 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 203 transitions. [2024-11-28 04:31:42,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-28 04:31:42,543 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:31:42,543 INFO L218 NwaCegarLoop]: trace histogram [45, 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-28 04:31:42,572 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-28 04:31:42,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:31:42,744 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 04:31:42,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:31:42,744 INFO L85 PathProgramCache]: Analyzing trace with hash 161574841, now seen corresponding path program 1 times [2024-11-28 04:31:42,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:31:42,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287758319] [2024-11-28 04:31:42,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:31:42,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:31:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:31:46,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 649 proven. 280 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2024-11-28 04:31:46,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:31:46,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287758319] [2024-11-28 04:31:46,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287758319] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:31:46,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996697839] [2024-11-28 04:31:46,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:31:46,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:31:46,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:31:46,501 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:31:46,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 04:31:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:31:47,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 1311 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-11-28 04:31:47,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:31:47,627 WARN L851 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_29| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l2_insert_#t~ret12#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_29| .cse0 (select |c_#valid| .cse0))))))) is different from false [2024-11-28 04:31:47,631 WARN L873 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_29| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l2_insert_#t~ret12#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_29| .cse0 (select |c_#valid| .cse0))))))) is different from true [2024-11-28 04:31:47,656 WARN L851 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_29| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_29| .cse0 (select |c_#valid| .cse0))))))) is different from false [2024-11-28 04:31:47,661 WARN L873 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_29| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_29| .cse0 (select |c_#valid| .cse0))))))) is different from true [2024-11-28 04:31:47,685 WARN L851 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_29| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_29| .cse0 (select |c_#valid| .cse0))))))) is different from false [2024-11-28 04:31:47,689 WARN L873 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_29| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_29| .cse0 (select |c_#valid| .cse0))))))) is different from true [2024-11-28 04:31:47,960 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= |c_ULTIMATE.start_l3_insert_#t~ret9#1.base| .cse0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse0 (select |c_#valid| .cse0))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse1) (= (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_old(#valid)_AFTER_CALL_62| .cse1)) |v_old(#valid)_AFTER_CALL_62|))))))) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= |c_ULTIMATE.start_l3_insert_#t~ret9#1.base| .cse2) (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse2 (select |c_#valid| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_29| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= |c_#valid| (store |v_#valid_BEFORE_CALL_29| .cse3 (select |c_#valid| .cse3))))))) is different from false [2024-11-28 04:31:47,969 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= |c_ULTIMATE.start_l3_insert_#t~ret9#1.base| .cse0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse0 (select |c_#valid| .cse0))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse1) (= (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_old(#valid)_AFTER_CALL_62| .cse1)) |v_old(#valid)_AFTER_CALL_62|))))))) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= |c_ULTIMATE.start_l3_insert_#t~ret9#1.base| .cse2) (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse2 (select |c_#valid| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_29| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= |c_#valid| (store |v_#valid_BEFORE_CALL_29| .cse3 (select |c_#valid| .cse3))))))) is different from true [2024-11-28 04:31:48,068 WARN L851 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= .cse0 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse0 (select |c_#valid| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse1 (select |c_#valid| .cse1))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (store |v_#valid_BEFORE_CALL_29| .cse2 (select |v_old(#valid)_AFTER_CALL_62| .cse2)) |v_old(#valid)_AFTER_CALL_62|))))))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_29| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= |c_#valid| (store |v_#valid_BEFORE_CALL_29| .cse3 (select |c_#valid| .cse3))))))) is different from false [2024-11-28 04:31:48,075 WARN L873 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= .cse0 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse0 (select |c_#valid| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse1 (select |c_#valid| .cse1))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (store |v_#valid_BEFORE_CALL_29| .cse2 (select |v_old(#valid)_AFTER_CALL_62| .cse2)) |v_old(#valid)_AFTER_CALL_62|))))))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_29| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= |c_#valid| (store |v_#valid_BEFORE_CALL_29| .cse3 (select |c_#valid| .cse3))))))) is different from true [2024-11-28 04:31:48,162 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse0 (select |c_#valid| .cse0))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse0)))) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse1 (select |c_#valid| .cse1))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (store |v_#valid_BEFORE_CALL_29| .cse2 (select |v_old(#valid)_AFTER_CALL_62| .cse2)) |v_old(#valid)_AFTER_CALL_62|))))))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_29| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= |c_#valid| (store |v_#valid_BEFORE_CALL_29| .cse3 (select |c_#valid| .cse3))))))) is different from false [2024-11-28 04:31:48,168 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse0 (select |c_#valid| .cse0))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse0)))) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse1 (select |c_#valid| .cse1))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (store |v_#valid_BEFORE_CALL_29| .cse2 (select |v_old(#valid)_AFTER_CALL_62| .cse2)) |v_old(#valid)_AFTER_CALL_62|))))))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_29| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= |c_#valid| (store |v_#valid_BEFORE_CALL_29| .cse3 (select |c_#valid| .cse3))))))) is different from true [2024-11-28 04:31:52,552 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse0 (select |c_#valid| .cse0))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse0)))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse2 (select |v_old(#valid)_AFTER_CALL_63| .cse2)) |v_old(#valid)_AFTER_CALL_63|) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse3 (select |c_#valid| .cse3))) (= .cse3 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse4 (select |v_old(#valid)_AFTER_CALL_63| .cse4)) |v_old(#valid)_AFTER_CALL_63|) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse5) (= (store |v_#valid_BEFORE_CALL_29| .cse5 (select |v_old(#valid)_AFTER_CALL_62| .cse5)) |v_old(#valid)_AFTER_CALL_62|)))) (= .cse4 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse6 (select |c_#valid| .cse6))) (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse6 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|)))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse7 (select |c_#valid| .cse7))) (= .cse7 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse8) (= (store |v_#valid_BEFORE_CALL_29| .cse8 (select |v_old(#valid)_AFTER_CALL_63| .cse8)) |v_old(#valid)_AFTER_CALL_63|))))))) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse9 (select |c_#valid| .cse9))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse9) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse10) (= (store |v_#valid_BEFORE_CALL_29| .cse10 (select |v_old(#valid)_AFTER_CALL_62| .cse10)) |v_old(#valid)_AFTER_CALL_62|))))))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_29| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse11) (= |c_#valid| (store |v_#valid_BEFORE_CALL_29| .cse11 (select |c_#valid| .cse11))))))) is different from false [2024-11-28 04:31:52,575 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse0 (select |c_#valid| .cse0))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse0)))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse2 (select |v_old(#valid)_AFTER_CALL_63| .cse2)) |v_old(#valid)_AFTER_CALL_63|) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse3 (select |c_#valid| .cse3))) (= .cse3 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse4 (select |v_old(#valid)_AFTER_CALL_63| .cse4)) |v_old(#valid)_AFTER_CALL_63|) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse5) (= (store |v_#valid_BEFORE_CALL_29| .cse5 (select |v_old(#valid)_AFTER_CALL_62| .cse5)) |v_old(#valid)_AFTER_CALL_62|)))) (= .cse4 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse6 (select |c_#valid| .cse6))) (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse6 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|)))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse7 (select |c_#valid| .cse7))) (= .cse7 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse8) (= (store |v_#valid_BEFORE_CALL_29| .cse8 (select |v_old(#valid)_AFTER_CALL_63| .cse8)) |v_old(#valid)_AFTER_CALL_63|))))))) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse9 (select |c_#valid| .cse9))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse9) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse10) (= (store |v_#valid_BEFORE_CALL_29| .cse10 (select |v_old(#valid)_AFTER_CALL_62| .cse10)) |v_old(#valid)_AFTER_CALL_62|))))))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_29| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse11) (= |c_#valid| (store |v_#valid_BEFORE_CALL_29| .cse11 (select |c_#valid| .cse11))))))) is different from true [2024-11-28 04:31:56,812 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse0 (select |c_#valid| .cse0))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse0)))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse1 (select |c_#valid| .cse1))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (store |v_#valid_BEFORE_CALL_29| .cse2 (select |v_old(#valid)_AFTER_CALL_63| .cse2)) |v_old(#valid)_AFTER_CALL_63|)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1)))) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse3 (select |c_#valid| .cse3))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse4) (= (store |v_#valid_BEFORE_CALL_29| .cse4 (select |v_old(#valid)_AFTER_CALL_62| .cse4)) |v_old(#valid)_AFTER_CALL_62|))))))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse5 (select |c_#valid| .cse5))) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse6 (select |v_old(#valid)_AFTER_CALL_63| .cse6)) |v_old(#valid)_AFTER_CALL_63|) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse7) (= (store |v_#valid_BEFORE_CALL_29| .cse7 (select |v_old(#valid)_AFTER_CALL_62| .cse7)) |v_old(#valid)_AFTER_CALL_62|)))) (= .cse6 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse5)))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse8 (select |c_#valid| .cse8))) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse9 (select |v_old(#valid)_AFTER_CALL_63| .cse9)) |v_old(#valid)_AFTER_CALL_63|) (= .cse9 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse8)))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse10 (select |c_#valid| .cse10))) (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse10)))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_29| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse11) (= |c_#valid| (store |v_#valid_BEFORE_CALL_29| .cse11 (select |c_#valid| .cse11))))))) is different from false [2024-11-28 04:31:56,842 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse0 (select |c_#valid| .cse0))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse0)))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse1 (select |c_#valid| .cse1))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (store |v_#valid_BEFORE_CALL_29| .cse2 (select |v_old(#valid)_AFTER_CALL_63| .cse2)) |v_old(#valid)_AFTER_CALL_63|)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1)))) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse3 (select |c_#valid| .cse3))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse4) (= (store |v_#valid_BEFORE_CALL_29| .cse4 (select |v_old(#valid)_AFTER_CALL_62| .cse4)) |v_old(#valid)_AFTER_CALL_62|))))))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse5 (select |c_#valid| .cse5))) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse6 (select |v_old(#valid)_AFTER_CALL_63| .cse6)) |v_old(#valid)_AFTER_CALL_63|) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse7) (= (store |v_#valid_BEFORE_CALL_29| .cse7 (select |v_old(#valid)_AFTER_CALL_62| .cse7)) |v_old(#valid)_AFTER_CALL_62|)))) (= .cse6 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse5)))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse8 (select |c_#valid| .cse8))) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse9 (select |v_old(#valid)_AFTER_CALL_63| .cse9)) |v_old(#valid)_AFTER_CALL_63|) (= .cse9 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse8)))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse10 (select |c_#valid| .cse10))) (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse10)))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_29| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse11) (= |c_#valid| (store |v_#valid_BEFORE_CALL_29| .cse11 (select |c_#valid| .cse11))))))) is different from true [2024-11-28 04:31:56,945 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-28 04:31:57,289 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 04:31:57,289 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-28 04:32:01,327 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse1) (= (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_old(#valid)_AFTER_CALL_63| .cse1)) |v_old(#valid)_AFTER_CALL_63|)))) (= (store |v_old(#valid)_AFTER_CALL_63| .cse0 (select |v_old(#valid)_AFTER_CALL_64| .cse0)) |v_old(#valid)_AFTER_CALL_64|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse2 (select |v_old(#valid)_AFTER_CALL_64| .cse2)) |v_old(#valid)_AFTER_CALL_64|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_63| .cse3 (select |v_old(#valid)_AFTER_CALL_64| .cse3)) |v_old(#valid)_AFTER_CALL_64|) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse4 (select |v_old(#valid)_AFTER_CALL_63| .cse4)) |v_old(#valid)_AFTER_CALL_63|) (= .cse4 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse5 (select |v_old(#valid)_AFTER_CALL_64| .cse5)) |v_old(#valid)_AFTER_CALL_64|) (= .cse5 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse6) (= (store |v_#valid_BEFORE_CALL_29| .cse6 (select |v_old(#valid)_AFTER_CALL_62| .cse6)) |v_old(#valid)_AFTER_CALL_62|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse7) (= (store |v_old(#valid)_AFTER_CALL_63| .cse7 (select |v_old(#valid)_AFTER_CALL_64| .cse7)) |v_old(#valid)_AFTER_CALL_64|) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse8 (select |v_old(#valid)_AFTER_CALL_63| .cse8)) |v_old(#valid)_AFTER_CALL_63|) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse9) (= (store |v_#valid_BEFORE_CALL_29| .cse9 (select |v_old(#valid)_AFTER_CALL_62| .cse9)) |v_old(#valid)_AFTER_CALL_62|)))) (= .cse8 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse10 (select |v_old(#valid)_AFTER_CALL_64| .cse10)) |v_old(#valid)_AFTER_CALL_64|) (= .cse10 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_old(#valid)_AFTER_CALL_62| |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)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse11 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_29| .cse11 (select |v_old(#valid)_AFTER_CALL_64| .cse11)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |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_l2_insert_~list#1.base|) 1))) is different from false [2024-11-28 04:32:01,339 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse1) (= (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_old(#valid)_AFTER_CALL_63| .cse1)) |v_old(#valid)_AFTER_CALL_63|)))) (= (store |v_old(#valid)_AFTER_CALL_63| .cse0 (select |v_old(#valid)_AFTER_CALL_64| .cse0)) |v_old(#valid)_AFTER_CALL_64|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse2 (select |v_old(#valid)_AFTER_CALL_64| .cse2)) |v_old(#valid)_AFTER_CALL_64|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_63| .cse3 (select |v_old(#valid)_AFTER_CALL_64| .cse3)) |v_old(#valid)_AFTER_CALL_64|) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse4 (select |v_old(#valid)_AFTER_CALL_63| .cse4)) |v_old(#valid)_AFTER_CALL_63|) (= .cse4 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse5 (select |v_old(#valid)_AFTER_CALL_64| .cse5)) |v_old(#valid)_AFTER_CALL_64|) (= .cse5 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse6) (= (store |v_#valid_BEFORE_CALL_29| .cse6 (select |v_old(#valid)_AFTER_CALL_62| .cse6)) |v_old(#valid)_AFTER_CALL_62|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse7) (= (store |v_old(#valid)_AFTER_CALL_63| .cse7 (select |v_old(#valid)_AFTER_CALL_64| .cse7)) |v_old(#valid)_AFTER_CALL_64|) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse8 (select |v_old(#valid)_AFTER_CALL_63| .cse8)) |v_old(#valid)_AFTER_CALL_63|) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse9) (= (store |v_#valid_BEFORE_CALL_29| .cse9 (select |v_old(#valid)_AFTER_CALL_62| .cse9)) |v_old(#valid)_AFTER_CALL_62|)))) (= .cse8 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse10 (select |v_old(#valid)_AFTER_CALL_64| .cse10)) |v_old(#valid)_AFTER_CALL_64|) (= .cse10 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_old(#valid)_AFTER_CALL_62| |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)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse11 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_29| .cse11 (select |v_old(#valid)_AFTER_CALL_64| .cse11)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |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_l2_insert_~list#1.base|) 1))) is different from true [2024-11-28 04:32:05,664 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse1) (= (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_old(#valid)_AFTER_CALL_63| .cse1)) |v_old(#valid)_AFTER_CALL_63|)))) (= (store |v_old(#valid)_AFTER_CALL_63| .cse0 (select |v_old(#valid)_AFTER_CALL_64| .cse0)) |v_old(#valid)_AFTER_CALL_64|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse2 (select |v_old(#valid)_AFTER_CALL_64| .cse2)) |v_old(#valid)_AFTER_CALL_64|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_63| .cse3 (select |v_old(#valid)_AFTER_CALL_64| .cse3)) |v_old(#valid)_AFTER_CALL_64|) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse4 (select |v_old(#valid)_AFTER_CALL_63| .cse4)) |v_old(#valid)_AFTER_CALL_63|) (= .cse4 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse5 (select |v_old(#valid)_AFTER_CALL_64| .cse5)) |v_old(#valid)_AFTER_CALL_64|) (= .cse5 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse6) (= (store |v_#valid_BEFORE_CALL_29| .cse6 (select |v_old(#valid)_AFTER_CALL_62| .cse6)) |v_old(#valid)_AFTER_CALL_62|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse7) (= (store |v_old(#valid)_AFTER_CALL_63| .cse7 (select |v_old(#valid)_AFTER_CALL_64| .cse7)) |v_old(#valid)_AFTER_CALL_64|) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse8 (select |v_old(#valid)_AFTER_CALL_63| .cse8)) |v_old(#valid)_AFTER_CALL_63|) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse9) (= (store |v_#valid_BEFORE_CALL_29| .cse9 (select |v_old(#valid)_AFTER_CALL_62| .cse9)) |v_old(#valid)_AFTER_CALL_62|)))) (= .cse8 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse10 (select |v_old(#valid)_AFTER_CALL_64| .cse10)) |v_old(#valid)_AFTER_CALL_64|) (= .cse10 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_old(#valid)_AFTER_CALL_62| |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)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse11 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_29| .cse11 (select |v_old(#valid)_AFTER_CALL_64| .cse11)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |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_l2_insert_~list#1.base|) 1)))) is different from false [2024-11-28 04:32:05,676 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse1) (= (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_old(#valid)_AFTER_CALL_63| .cse1)) |v_old(#valid)_AFTER_CALL_63|)))) (= (store |v_old(#valid)_AFTER_CALL_63| .cse0 (select |v_old(#valid)_AFTER_CALL_64| .cse0)) |v_old(#valid)_AFTER_CALL_64|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse2 (select |v_old(#valid)_AFTER_CALL_64| .cse2)) |v_old(#valid)_AFTER_CALL_64|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_63| .cse3 (select |v_old(#valid)_AFTER_CALL_64| .cse3)) |v_old(#valid)_AFTER_CALL_64|) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse4 (select |v_old(#valid)_AFTER_CALL_63| .cse4)) |v_old(#valid)_AFTER_CALL_63|) (= .cse4 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse5 (select |v_old(#valid)_AFTER_CALL_64| .cse5)) |v_old(#valid)_AFTER_CALL_64|) (= .cse5 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse6) (= (store |v_#valid_BEFORE_CALL_29| .cse6 (select |v_old(#valid)_AFTER_CALL_62| .cse6)) |v_old(#valid)_AFTER_CALL_62|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse7) (= (store |v_old(#valid)_AFTER_CALL_63| .cse7 (select |v_old(#valid)_AFTER_CALL_64| .cse7)) |v_old(#valid)_AFTER_CALL_64|) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse8 (select |v_old(#valid)_AFTER_CALL_63| .cse8)) |v_old(#valid)_AFTER_CALL_63|) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse9) (= (store |v_#valid_BEFORE_CALL_29| .cse9 (select |v_old(#valid)_AFTER_CALL_62| .cse9)) |v_old(#valid)_AFTER_CALL_62|)))) (= .cse8 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse10 (select |v_old(#valid)_AFTER_CALL_64| .cse10)) |v_old(#valid)_AFTER_CALL_64|) (= .cse10 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_old(#valid)_AFTER_CALL_62| |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)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse11 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_29| .cse11 (select |v_old(#valid)_AFTER_CALL_64| .cse11)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |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_l2_insert_~list#1.base|) 1)))) is different from true [2024-11-28 04:32:10,468 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (let ((.cse2 (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_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|)) (.cse0 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse0 (select |v_old(#valid)_AFTER_CALL_64| .cse0)) |v_old(#valid)_AFTER_CALL_64|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse1) (= (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_old(#valid)_AFTER_CALL_62| .cse1)) |v_old(#valid)_AFTER_CALL_62|) (= |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) .cse2) (and .cse2 (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse3 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_29| .cse3 (select |v_old(#valid)_AFTER_CALL_64| .cse3))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|)) (.cse5 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse4) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse5) (= (store |v_old(#valid)_AFTER_CALL_63| .cse4 (select |v_old(#valid)_AFTER_CALL_64| .cse4)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_#valid_BEFORE_CALL_29| .cse5 (select |v_old(#valid)_AFTER_CALL_63| .cse5)) |v_old(#valid)_AFTER_CALL_63|)))) .cse2) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|)) (.cse7 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse6) (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse7 (select |v_old(#valid)_AFTER_CALL_63| .cse7)) |v_old(#valid)_AFTER_CALL_63|) (= (store |v_old(#valid)_AFTER_CALL_63| .cse6 (select |v_old(#valid)_AFTER_CALL_64| .cse6)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse7) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|)) (.cse10 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|)) (.cse9 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse8) (= (store |v_old(#valid)_AFTER_CALL_62| .cse9 (select |v_old(#valid)_AFTER_CALL_63| .cse9)) |v_old(#valid)_AFTER_CALL_63|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse10) (= (store |v_old(#valid)_AFTER_CALL_63| .cse8 (select |v_old(#valid)_AFTER_CALL_64| .cse8)) |v_old(#valid)_AFTER_CALL_64|) (= (store |v_#valid_BEFORE_CALL_29| .cse10 (select |v_old(#valid)_AFTER_CALL_62| .cse10)) |v_old(#valid)_AFTER_CALL_62|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse9) 1)))) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse11) (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse11 (select |v_old(#valid)_AFTER_CALL_64| .cse11)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse2) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse12 (select |v_old(#valid)_AFTER_CALL_64| .cse12)) |v_old(#valid)_AFTER_CALL_64|) (= (select |v_old(#valid)_AFTER_CALL_62| |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| .cse12) 1))))))) is different from false [2024-11-28 04:32:10,479 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (let ((.cse2 (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_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|)) (.cse0 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse0 (select |v_old(#valid)_AFTER_CALL_64| .cse0)) |v_old(#valid)_AFTER_CALL_64|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse1) (= (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_old(#valid)_AFTER_CALL_62| .cse1)) |v_old(#valid)_AFTER_CALL_62|) (= |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) .cse2) (and .cse2 (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse3 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_29| .cse3 (select |v_old(#valid)_AFTER_CALL_64| .cse3))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|)) (.cse5 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse4) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse5) (= (store |v_old(#valid)_AFTER_CALL_63| .cse4 (select |v_old(#valid)_AFTER_CALL_64| .cse4)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_#valid_BEFORE_CALL_29| .cse5 (select |v_old(#valid)_AFTER_CALL_63| .cse5)) |v_old(#valid)_AFTER_CALL_63|)))) .cse2) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|)) (.cse7 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse6) (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse7 (select |v_old(#valid)_AFTER_CALL_63| .cse7)) |v_old(#valid)_AFTER_CALL_63|) (= (store |v_old(#valid)_AFTER_CALL_63| .cse6 (select |v_old(#valid)_AFTER_CALL_64| .cse6)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse7) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|)) (.cse10 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|)) (.cse9 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse8) (= (store |v_old(#valid)_AFTER_CALL_62| .cse9 (select |v_old(#valid)_AFTER_CALL_63| .cse9)) |v_old(#valid)_AFTER_CALL_63|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse10) (= (store |v_old(#valid)_AFTER_CALL_63| .cse8 (select |v_old(#valid)_AFTER_CALL_64| .cse8)) |v_old(#valid)_AFTER_CALL_64|) (= (store |v_#valid_BEFORE_CALL_29| .cse10 (select |v_old(#valid)_AFTER_CALL_62| .cse10)) |v_old(#valid)_AFTER_CALL_62|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse9) 1)))) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse11) (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse11 (select |v_old(#valid)_AFTER_CALL_64| .cse11)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse2) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse12 (select |v_old(#valid)_AFTER_CALL_64| .cse12)) |v_old(#valid)_AFTER_CALL_64|) (= (select |v_old(#valid)_AFTER_CALL_62| |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| .cse12) 1))))))) is different from true [2024-11-28 04:32:15,451 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_ArrVal_5041 Int)) (= (select |c_#valid| v_ArrVal_5041) 1))) (.cse3 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1)) |v_old(#valid)_AFTER_CALL_64|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (store |v_#valid_BEFORE_CALL_29| .cse2 (select |v_old(#valid)_AFTER_CALL_62| .cse2)) |v_old(#valid)_AFTER_CALL_62|) (= |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)) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) .cse0 .cse3) (and .cse0 .cse3 (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse4 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_29| .cse4 (select |v_old(#valid)_AFTER_CALL_64| .cse4))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse5 (select |v_old(#valid)_AFTER_CALL_64| .cse5)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse5) 1)))) .cse3) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse6 (select |v_old(#valid)_AFTER_CALL_64| .cse6)) |v_old(#valid)_AFTER_CALL_64|) (= (select |v_old(#valid)_AFTER_CALL_62| |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| .cse6) 1))))) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|)) (.cse7 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|)) (.cse9 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse7 (select |v_old(#valid)_AFTER_CALL_63| .cse7)) |v_old(#valid)_AFTER_CALL_63|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse8) (= (store |v_old(#valid)_AFTER_CALL_63| .cse9 (select |v_old(#valid)_AFTER_CALL_64| .cse9)) |v_old(#valid)_AFTER_CALL_64|) (= (store |v_#valid_BEFORE_CALL_29| .cse8 (select |v_old(#valid)_AFTER_CALL_62| .cse8)) |v_old(#valid)_AFTER_CALL_62|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse7) 1) (= (select |c_#valid| .cse9) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|)) (.cse11 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse10 (select |v_old(#valid)_AFTER_CALL_63| .cse10)) |v_old(#valid)_AFTER_CALL_63|) (= (store |v_old(#valid)_AFTER_CALL_63| .cse11 (select |v_old(#valid)_AFTER_CALL_64| .cse11)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse10) 1) (= (select |c_#valid| .cse11) 1)))) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|)) (.cse12 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse12) (= (store |v_old(#valid)_AFTER_CALL_63| .cse13 (select |v_old(#valid)_AFTER_CALL_64| .cse13)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse13) 1) (= (store |v_#valid_BEFORE_CALL_29| .cse12 (select |v_old(#valid)_AFTER_CALL_63| .cse12)) |v_old(#valid)_AFTER_CALL_63|)))) .cse3))) is different from false [2024-11-28 04:32:15,463 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_ArrVal_5041 Int)) (= (select |c_#valid| v_ArrVal_5041) 1))) (.cse3 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1)) |v_old(#valid)_AFTER_CALL_64|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (store |v_#valid_BEFORE_CALL_29| .cse2 (select |v_old(#valid)_AFTER_CALL_62| .cse2)) |v_old(#valid)_AFTER_CALL_62|) (= |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)) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) .cse0 .cse3) (and .cse0 .cse3 (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse4 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_29| .cse4 (select |v_old(#valid)_AFTER_CALL_64| .cse4))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse5 (select |v_old(#valid)_AFTER_CALL_64| .cse5)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse5) 1)))) .cse3) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse6 (select |v_old(#valid)_AFTER_CALL_64| .cse6)) |v_old(#valid)_AFTER_CALL_64|) (= (select |v_old(#valid)_AFTER_CALL_62| |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| .cse6) 1))))) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|)) (.cse7 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|)) (.cse9 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse7 (select |v_old(#valid)_AFTER_CALL_63| .cse7)) |v_old(#valid)_AFTER_CALL_63|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse8) (= (store |v_old(#valid)_AFTER_CALL_63| .cse9 (select |v_old(#valid)_AFTER_CALL_64| .cse9)) |v_old(#valid)_AFTER_CALL_64|) (= (store |v_#valid_BEFORE_CALL_29| .cse8 (select |v_old(#valid)_AFTER_CALL_62| .cse8)) |v_old(#valid)_AFTER_CALL_62|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse7) 1) (= (select |c_#valid| .cse9) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|)) (.cse11 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse10 (select |v_old(#valid)_AFTER_CALL_63| .cse10)) |v_old(#valid)_AFTER_CALL_63|) (= (store |v_old(#valid)_AFTER_CALL_63| .cse11 (select |v_old(#valid)_AFTER_CALL_64| .cse11)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse10) 1) (= (select |c_#valid| .cse11) 1)))) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|)) (.cse12 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse12) (= (store |v_old(#valid)_AFTER_CALL_63| .cse13 (select |v_old(#valid)_AFTER_CALL_64| .cse13)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse13) 1) (= (store |v_#valid_BEFORE_CALL_29| .cse12 (select |v_old(#valid)_AFTER_CALL_63| .cse12)) |v_old(#valid)_AFTER_CALL_63|)))) .cse3))) is different from true [2024-11-28 04:32:20,384 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (exists ((v_ArrVal_5041 Int)) (= (select |c_#valid| v_ArrVal_5041) 1))) (.cse3 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse7 (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_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|)) (.cse0 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|)) (.cse2 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse0 (select |v_old(#valid)_AFTER_CALL_63| .cse0)) |v_old(#valid)_AFTER_CALL_63|) (= (select |c_#valid| .cse1) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse2 (select |v_old(#valid)_AFTER_CALL_64| .cse2)) |v_old(#valid)_AFTER_CALL_64|) (= (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_old(#valid)_AFTER_CALL_62| .cse1)) |v_old(#valid)_AFTER_CALL_62|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| .cse2) 1)))) (and .cse3 (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|)) (.cse4 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |c_#valid| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse5 (select |v_old(#valid)_AFTER_CALL_64| .cse5)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse5) 1) (= (store |v_#valid_BEFORE_CALL_29| .cse4 (select |v_old(#valid)_AFTER_CALL_63| .cse4)) |v_old(#valid)_AFTER_CALL_63|))))) (and .cse6 .cse7 (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse8 (select |v_old(#valid)_AFTER_CALL_64| .cse8)) |v_old(#valid)_AFTER_CALL_64|) (= (select |v_old(#valid)_AFTER_CALL_62| |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| .cse8) 1))))) (and (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|)) (.cse10 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse9 (select |v_old(#valid)_AFTER_CALL_63| .cse9)) |v_old(#valid)_AFTER_CALL_63|) (= (store |v_old(#valid)_AFTER_CALL_63| .cse10 (select |v_old(#valid)_AFTER_CALL_64| .cse10)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse9) 1) (= (select |c_#valid| .cse10) 1)))) .cse7) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse11 (select |v_old(#valid)_AFTER_CALL_64| .cse11)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse11) 1)))) .cse3 .cse7) (and .cse6 .cse3 (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |c_#valid| .cse12) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_29| .cse12 (select |v_old(#valid)_AFTER_CALL_64| .cse12))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse14 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|)) (.cse13 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse13 (select |v_old(#valid)_AFTER_CALL_64| .cse13)) |v_old(#valid)_AFTER_CALL_64|) (= (select |c_#valid| .cse14) 1) (= (store |v_#valid_BEFORE_CALL_29| .cse14 (select |v_old(#valid)_AFTER_CALL_62| .cse14)) |v_old(#valid)_AFTER_CALL_62|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse13) 1)))) .cse6) (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) .cse6 .cse3 .cse7))) is different from false [2024-11-28 04:32:20,396 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (exists ((v_ArrVal_5041 Int)) (= (select |c_#valid| v_ArrVal_5041) 1))) (.cse3 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse7 (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_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|)) (.cse0 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|)) (.cse2 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse0 (select |v_old(#valid)_AFTER_CALL_63| .cse0)) |v_old(#valid)_AFTER_CALL_63|) (= (select |c_#valid| .cse1) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse2 (select |v_old(#valid)_AFTER_CALL_64| .cse2)) |v_old(#valid)_AFTER_CALL_64|) (= (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_old(#valid)_AFTER_CALL_62| .cse1)) |v_old(#valid)_AFTER_CALL_62|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| .cse2) 1)))) (and .cse3 (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|)) (.cse4 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |c_#valid| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse5 (select |v_old(#valid)_AFTER_CALL_64| .cse5)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse5) 1) (= (store |v_#valid_BEFORE_CALL_29| .cse4 (select |v_old(#valid)_AFTER_CALL_63| .cse4)) |v_old(#valid)_AFTER_CALL_63|))))) (and .cse6 .cse7 (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse8 (select |v_old(#valid)_AFTER_CALL_64| .cse8)) |v_old(#valid)_AFTER_CALL_64|) (= (select |v_old(#valid)_AFTER_CALL_62| |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| .cse8) 1))))) (and (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|)) (.cse10 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse9 (select |v_old(#valid)_AFTER_CALL_63| .cse9)) |v_old(#valid)_AFTER_CALL_63|) (= (store |v_old(#valid)_AFTER_CALL_63| .cse10 (select |v_old(#valid)_AFTER_CALL_64| .cse10)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse9) 1) (= (select |c_#valid| .cse10) 1)))) .cse7) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse11 (select |v_old(#valid)_AFTER_CALL_64| .cse11)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse11) 1)))) .cse3 .cse7) (and .cse6 .cse3 (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |c_#valid| .cse12) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_29| .cse12 (select |v_old(#valid)_AFTER_CALL_64| .cse12))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse14 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|)) (.cse13 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse13 (select |v_old(#valid)_AFTER_CALL_64| .cse13)) |v_old(#valid)_AFTER_CALL_64|) (= (select |c_#valid| .cse14) 1) (= (store |v_#valid_BEFORE_CALL_29| .cse14 (select |v_old(#valid)_AFTER_CALL_62| .cse14)) |v_old(#valid)_AFTER_CALL_62|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse13) 1)))) .cse6) (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) .cse6 .cse3 .cse7))) is different from true [2024-11-28 04:32:21,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 421 proven. 268 refuted. 0 times theorem prover too weak. 466 trivial. 240 not checked. [2024-11-28 04:32:21,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:32:22,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996697839] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:32:22,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:32:22,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 29] total 39 [2024-11-28 04:32:22,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606448806] [2024-11-28 04:32:22,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:32:22,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-28 04:32:22,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:32:22,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-28 04:32:22,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=776, Unknown=27, NotChecked=966, Total=1892 [2024-11-28 04:32:22,336 INFO L87 Difference]: Start difference. First operand 188 states and 203 transitions. Second operand has 40 states, 35 states have (on average 2.6857142857142855) internal successors, (94), 31 states have internal predecessors, (94), 8 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-28 04:32:23,205 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) .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse1 |c_ULTIMATE.start_l2_insert_#t~ret12#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_29| .cse1 (select |c_#valid| .cse1))))))))) is different from false [2024-11-28 04:32:23,209 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) .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse1 |c_ULTIMATE.start_l2_insert_#t~ret12#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_29| .cse1 (select |c_#valid| .cse1))))))))) is different from true [2024-11-28 04:32:23,213 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_29| .cse1 (select |c_#valid| .cse1))))))) (or (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) .cse0))) is different from false [2024-11-28 04:32:23,217 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_29| .cse1 (select |c_#valid| .cse1))))))) (or (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) .cse0))) is different from true [2024-11-28 04:32:23,222 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|)) (or .cse0 (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_29| .cse1 (select |c_#valid| .cse1))))))))) is different from false [2024-11-28 04:32:23,226 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|)) (or .cse0 (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_29| .cse1 (select |c_#valid| .cse1))))))))) is different from true [2024-11-28 04:32:23,263 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= |c_ULTIMATE.start_l3_insert_#t~ret9#1.base| .cse0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse0 (select |c_#valid| .cse0))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse1) (= (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_old(#valid)_AFTER_CALL_62| .cse1)) |v_old(#valid)_AFTER_CALL_62|))))))) .cse2 (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= |c_ULTIMATE.start_l3_insert_#t~ret9#1.base| .cse3) (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse3 (select |c_#valid| .cse3)))))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_29| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse4) (= |c_#valid| (store |v_#valid_BEFORE_CALL_29| .cse4 (select |c_#valid| .cse4))))))) (or .cse2 (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_#t~ret9#1.base|)))) is different from false [2024-11-28 04:32:23,270 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= |c_ULTIMATE.start_l3_insert_#t~ret9#1.base| .cse0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse0 (select |c_#valid| .cse0))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse1) (= (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_old(#valid)_AFTER_CALL_62| .cse1)) |v_old(#valid)_AFTER_CALL_62|))))))) .cse2 (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= |c_ULTIMATE.start_l3_insert_#t~ret9#1.base| .cse3) (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse3 (select |c_#valid| .cse3)))))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_29| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse4) (= |c_#valid| (store |v_#valid_BEFORE_CALL_29| .cse4 (select |c_#valid| .cse4))))))) (or .cse2 (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_#t~ret9#1.base|)))) is different from true [2024-11-28 04:32:23,293 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 .cse0 (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse1 (select |c_#valid| .cse1)))))) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= .cse2 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse2 (select |c_#valid| .cse2))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= (store |v_#valid_BEFORE_CALL_29| .cse3 (select |v_old(#valid)_AFTER_CALL_62| .cse3)) |v_old(#valid)_AFTER_CALL_62|))))))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_29| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse4) (= |c_#valid| (store |v_#valid_BEFORE_CALL_29| .cse4 (select |c_#valid| .cse4))))))))) is different from false [2024-11-28 04:32:23,299 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 .cse0 (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse1 (select |c_#valid| .cse1)))))) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= .cse2 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse2 (select |c_#valid| .cse2))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= (store |v_#valid_BEFORE_CALL_29| .cse3 (select |v_old(#valid)_AFTER_CALL_62| .cse3)) |v_old(#valid)_AFTER_CALL_62|))))))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_29| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse4) (= |c_#valid| (store |v_#valid_BEFORE_CALL_29| .cse4 (select |c_#valid| .cse4))))))))) is different from true [2024-11-28 04:32:23,334 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse0 (select |c_#valid| .cse0))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse0)))) .cse1 (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse2 (select |c_#valid| .cse2))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= (store |v_#valid_BEFORE_CALL_29| .cse3 (select |v_old(#valid)_AFTER_CALL_62| .cse3)) |v_old(#valid)_AFTER_CALL_62|))))))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_29| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse4) (= |c_#valid| (store |v_#valid_BEFORE_CALL_29| .cse4 (select |c_#valid| .cse4))))))) (or (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse1 (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|)))) is different from false [2024-11-28 04:32:23,340 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse0 (select |c_#valid| .cse0))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse0)))) .cse1 (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse2 (select |c_#valid| .cse2))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= (store |v_#valid_BEFORE_CALL_29| .cse3 (select |v_old(#valid)_AFTER_CALL_62| .cse3)) |v_old(#valid)_AFTER_CALL_62|))))))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_29| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse4) (= |c_#valid| (store |v_#valid_BEFORE_CALL_29| .cse4 (select |c_#valid| .cse4))))))) (or (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse1 (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|)))) is different from true [2024-11-28 04:32:27,309 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|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|)) (or (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse1 (select |c_#valid| .cse1))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse1)))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse3 (select |v_old(#valid)_AFTER_CALL_63| .cse3)) |v_old(#valid)_AFTER_CALL_63|) (= .cse3 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse4 (select |c_#valid| .cse4))) (= .cse4 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse5 (select |v_old(#valid)_AFTER_CALL_63| .cse5)) |v_old(#valid)_AFTER_CALL_63|) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse6) (= (store |v_#valid_BEFORE_CALL_29| .cse6 (select |v_old(#valid)_AFTER_CALL_62| .cse6)) |v_old(#valid)_AFTER_CALL_62|)))) (= .cse5 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) .cse0 (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse7 (select |c_#valid| .cse7))) (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse7 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|)))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse8 (select |c_#valid| .cse8))) (= .cse8 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse9) (= (store |v_#valid_BEFORE_CALL_29| .cse9 (select |v_old(#valid)_AFTER_CALL_63| .cse9)) |v_old(#valid)_AFTER_CALL_63|))))))) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse10 (select |c_#valid| .cse10))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse10) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse11) (= (store |v_#valid_BEFORE_CALL_29| .cse11 (select |v_old(#valid)_AFTER_CALL_62| .cse11)) |v_old(#valid)_AFTER_CALL_62|))))))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_29| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse12) (= |c_#valid| (store |v_#valid_BEFORE_CALL_29| .cse12 (select |c_#valid| .cse12))))))))) is different from false [2024-11-28 04:32:27,319 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|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|)) (or (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse1 (select |c_#valid| .cse1))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse1)))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse3 (select |v_old(#valid)_AFTER_CALL_63| .cse3)) |v_old(#valid)_AFTER_CALL_63|) (= .cse3 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse4 (select |c_#valid| .cse4))) (= .cse4 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse5 (select |v_old(#valid)_AFTER_CALL_63| .cse5)) |v_old(#valid)_AFTER_CALL_63|) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse6) (= (store |v_#valid_BEFORE_CALL_29| .cse6 (select |v_old(#valid)_AFTER_CALL_62| .cse6)) |v_old(#valid)_AFTER_CALL_62|)))) (= .cse5 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) .cse0 (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse7 (select |c_#valid| .cse7))) (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse7 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|)))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse8 (select |c_#valid| .cse8))) (= .cse8 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse9) (= (store |v_#valid_BEFORE_CALL_29| .cse9 (select |v_old(#valid)_AFTER_CALL_63| .cse9)) |v_old(#valid)_AFTER_CALL_63|))))))) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse10 (select |c_#valid| .cse10))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse10) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse11) (= (store |v_#valid_BEFORE_CALL_29| .cse11 (select |v_old(#valid)_AFTER_CALL_62| .cse11)) |v_old(#valid)_AFTER_CALL_62|))))))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_29| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse12) (= |c_#valid| (store |v_#valid_BEFORE_CALL_29| .cse12 (select |c_#valid| .cse12))))))))) is different from true [2024-11-28 04:32:31,332 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 (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse1 (select |c_#valid| .cse1))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse1)))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse2 (select |c_#valid| .cse2))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= (store |v_#valid_BEFORE_CALL_29| .cse3 (select |v_old(#valid)_AFTER_CALL_63| .cse3)) |v_old(#valid)_AFTER_CALL_63|)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2)))) .cse0 (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse4 (select |c_#valid| .cse4))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse4) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse5) (= (store |v_#valid_BEFORE_CALL_29| .cse5 (select |v_old(#valid)_AFTER_CALL_62| .cse5)) |v_old(#valid)_AFTER_CALL_62|))))))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse6 (select |c_#valid| .cse6))) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse7 (select |v_old(#valid)_AFTER_CALL_63| .cse7)) |v_old(#valid)_AFTER_CALL_63|) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse8) (= (store |v_#valid_BEFORE_CALL_29| .cse8 (select |v_old(#valid)_AFTER_CALL_62| .cse8)) |v_old(#valid)_AFTER_CALL_62|)))) (= .cse7 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse6)))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse9 (select |c_#valid| .cse9))) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse10 (select |v_old(#valid)_AFTER_CALL_63| .cse10)) |v_old(#valid)_AFTER_CALL_63|) (= .cse10 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse9)))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse11 (select |c_#valid| .cse11))) (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse11)))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_29| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse12) (= |c_#valid| (store |v_#valid_BEFORE_CALL_29| .cse12 (select |c_#valid| .cse12))))))))) is different from false [2024-11-28 04:32:31,345 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 (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse1 (select |c_#valid| .cse1))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse1)))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse2 (select |c_#valid| .cse2))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= (store |v_#valid_BEFORE_CALL_29| .cse3 (select |v_old(#valid)_AFTER_CALL_63| .cse3)) |v_old(#valid)_AFTER_CALL_63|)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2)))) .cse0 (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_62| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_62| .cse4 (select |c_#valid| .cse4))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse4) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse5) (= (store |v_#valid_BEFORE_CALL_29| .cse5 (select |v_old(#valid)_AFTER_CALL_62| .cse5)) |v_old(#valid)_AFTER_CALL_62|))))))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse6 (select |c_#valid| .cse6))) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse7 (select |v_old(#valid)_AFTER_CALL_63| .cse7)) |v_old(#valid)_AFTER_CALL_63|) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse8) (= (store |v_#valid_BEFORE_CALL_29| .cse8 (select |v_old(#valid)_AFTER_CALL_62| .cse8)) |v_old(#valid)_AFTER_CALL_62|)))) (= .cse7 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse6)))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse9 (select |c_#valid| .cse9))) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse10 (select |v_old(#valid)_AFTER_CALL_63| .cse10)) |v_old(#valid)_AFTER_CALL_63|) (= .cse10 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse9)))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse11 (select |c_#valid| .cse11))) (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse11)))) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_29| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse12) (= |c_#valid| (store |v_#valid_BEFORE_CALL_29| .cse12 (select |c_#valid| .cse12))))))))) is different from true [2024-11-28 04:32:35,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_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 (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (store |v_#valid_BEFORE_CALL_29| .cse2 (select |v_old(#valid)_AFTER_CALL_63| .cse2)) |v_old(#valid)_AFTER_CALL_63|)))) (= (store |v_old(#valid)_AFTER_CALL_63| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1)) |v_old(#valid)_AFTER_CALL_64|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse3 (select |v_old(#valid)_AFTER_CALL_64| .cse3)) |v_old(#valid)_AFTER_CALL_64|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse4) (= (store |v_old(#valid)_AFTER_CALL_63| .cse4 (select |v_old(#valid)_AFTER_CALL_64| .cse4)) |v_old(#valid)_AFTER_CALL_64|) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse5 (select |v_old(#valid)_AFTER_CALL_63| .cse5)) |v_old(#valid)_AFTER_CALL_63|) (= .cse5 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse6 (select |v_old(#valid)_AFTER_CALL_64| .cse6)) |v_old(#valid)_AFTER_CALL_64|) (= .cse6 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse7) (= (store |v_#valid_BEFORE_CALL_29| .cse7 (select |v_old(#valid)_AFTER_CALL_62| .cse7)) |v_old(#valid)_AFTER_CALL_62|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse8) (= (store |v_old(#valid)_AFTER_CALL_63| .cse8 (select |v_old(#valid)_AFTER_CALL_64| .cse8)) |v_old(#valid)_AFTER_CALL_64|) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse9 (select |v_old(#valid)_AFTER_CALL_63| .cse9)) |v_old(#valid)_AFTER_CALL_63|) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse10) (= (store |v_#valid_BEFORE_CALL_29| .cse10 (select |v_old(#valid)_AFTER_CALL_62| .cse10)) |v_old(#valid)_AFTER_CALL_62|)))) (= .cse9 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse11 (select |v_old(#valid)_AFTER_CALL_64| .cse11)) |v_old(#valid)_AFTER_CALL_64|) (= .cse11 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_old(#valid)_AFTER_CALL_62| |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)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse12 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_29| .cse12 (select |v_old(#valid)_AFTER_CALL_64| .cse12)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |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)) .cse0)))) is different from false [2024-11-28 04:32:35,372 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 (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (store |v_#valid_BEFORE_CALL_29| .cse2 (select |v_old(#valid)_AFTER_CALL_63| .cse2)) |v_old(#valid)_AFTER_CALL_63|)))) (= (store |v_old(#valid)_AFTER_CALL_63| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1)) |v_old(#valid)_AFTER_CALL_64|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse3 (select |v_old(#valid)_AFTER_CALL_64| .cse3)) |v_old(#valid)_AFTER_CALL_64|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse4) (= (store |v_old(#valid)_AFTER_CALL_63| .cse4 (select |v_old(#valid)_AFTER_CALL_64| .cse4)) |v_old(#valid)_AFTER_CALL_64|) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse5 (select |v_old(#valid)_AFTER_CALL_63| .cse5)) |v_old(#valid)_AFTER_CALL_63|) (= .cse5 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse6 (select |v_old(#valid)_AFTER_CALL_64| .cse6)) |v_old(#valid)_AFTER_CALL_64|) (= .cse6 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse7) (= (store |v_#valid_BEFORE_CALL_29| .cse7 (select |v_old(#valid)_AFTER_CALL_62| .cse7)) |v_old(#valid)_AFTER_CALL_62|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse8) (= (store |v_old(#valid)_AFTER_CALL_63| .cse8 (select |v_old(#valid)_AFTER_CALL_64| .cse8)) |v_old(#valid)_AFTER_CALL_64|) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse9 (select |v_old(#valid)_AFTER_CALL_63| .cse9)) |v_old(#valid)_AFTER_CALL_63|) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse10) (= (store |v_#valid_BEFORE_CALL_29| .cse10 (select |v_old(#valid)_AFTER_CALL_62| .cse10)) |v_old(#valid)_AFTER_CALL_62|)))) (= .cse9 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse11 (select |v_old(#valid)_AFTER_CALL_64| .cse11)) |v_old(#valid)_AFTER_CALL_64|) (= .cse11 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_old(#valid)_AFTER_CALL_62| |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)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse12 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_29| .cse12 (select |v_old(#valid)_AFTER_CALL_64| .cse12)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |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)) .cse0)))) is different from true [2024-11-28 04:32:39,390 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (= (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 (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse1) (= (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_old(#valid)_AFTER_CALL_63| .cse1)) |v_old(#valid)_AFTER_CALL_63|)))) (= (store |v_old(#valid)_AFTER_CALL_63| .cse0 (select |v_old(#valid)_AFTER_CALL_64| .cse0)) |v_old(#valid)_AFTER_CALL_64|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse2 (select |v_old(#valid)_AFTER_CALL_64| .cse2)) |v_old(#valid)_AFTER_CALL_64|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_63| .cse3 (select |v_old(#valid)_AFTER_CALL_64| .cse3)) |v_old(#valid)_AFTER_CALL_64|) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse4 (select |v_old(#valid)_AFTER_CALL_63| .cse4)) |v_old(#valid)_AFTER_CALL_63|) (= .cse4 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse5 (select |v_old(#valid)_AFTER_CALL_64| .cse5)) |v_old(#valid)_AFTER_CALL_64|) (= .cse5 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse6) (= (store |v_#valid_BEFORE_CALL_29| .cse6 (select |v_old(#valid)_AFTER_CALL_62| .cse6)) |v_old(#valid)_AFTER_CALL_62|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse7) (= (store |v_old(#valid)_AFTER_CALL_63| .cse7 (select |v_old(#valid)_AFTER_CALL_64| .cse7)) |v_old(#valid)_AFTER_CALL_64|) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse8 (select |v_old(#valid)_AFTER_CALL_63| .cse8)) |v_old(#valid)_AFTER_CALL_63|) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse9) (= (store |v_#valid_BEFORE_CALL_29| .cse9 (select |v_old(#valid)_AFTER_CALL_62| .cse9)) |v_old(#valid)_AFTER_CALL_62|)))) (= .cse8 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse10 (select |v_old(#valid)_AFTER_CALL_64| .cse10)) |v_old(#valid)_AFTER_CALL_64|) (= .cse10 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_old(#valid)_AFTER_CALL_62| |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)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse11 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_29| .cse11 (select |v_old(#valid)_AFTER_CALL_64| .cse11)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |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)) .cse12)) (or (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse12 (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|)))) is different from false [2024-11-28 04:32:39,402 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse12 (= (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 (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse1) (= (store |v_#valid_BEFORE_CALL_29| .cse1 (select |v_old(#valid)_AFTER_CALL_63| .cse1)) |v_old(#valid)_AFTER_CALL_63|)))) (= (store |v_old(#valid)_AFTER_CALL_63| .cse0 (select |v_old(#valid)_AFTER_CALL_64| .cse0)) |v_old(#valid)_AFTER_CALL_64|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse2 (select |v_old(#valid)_AFTER_CALL_64| .cse2)) |v_old(#valid)_AFTER_CALL_64|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_63| .cse3 (select |v_old(#valid)_AFTER_CALL_64| .cse3)) |v_old(#valid)_AFTER_CALL_64|) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse4 (select |v_old(#valid)_AFTER_CALL_63| .cse4)) |v_old(#valid)_AFTER_CALL_63|) (= .cse4 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse5 (select |v_old(#valid)_AFTER_CALL_64| .cse5)) |v_old(#valid)_AFTER_CALL_64|) (= .cse5 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse6) (= (store |v_#valid_BEFORE_CALL_29| .cse6 (select |v_old(#valid)_AFTER_CALL_62| .cse6)) |v_old(#valid)_AFTER_CALL_62|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse7) (= (store |v_old(#valid)_AFTER_CALL_63| .cse7 (select |v_old(#valid)_AFTER_CALL_64| .cse7)) |v_old(#valid)_AFTER_CALL_64|) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse8 (select |v_old(#valid)_AFTER_CALL_63| .cse8)) |v_old(#valid)_AFTER_CALL_63|) (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse9) (= (store |v_#valid_BEFORE_CALL_29| .cse9 (select |v_old(#valid)_AFTER_CALL_62| .cse9)) |v_old(#valid)_AFTER_CALL_62|)))) (= .cse8 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse10 (select |v_old(#valid)_AFTER_CALL_64| .cse10)) |v_old(#valid)_AFTER_CALL_64|) (= .cse10 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_old(#valid)_AFTER_CALL_62| |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)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse11 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_29| .cse11 (select |v_old(#valid)_AFTER_CALL_64| .cse11)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |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)) .cse12)) (or (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse12 (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|)))) is different from true [2024-11-28 04:32:43,438 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 (= |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|)) (let ((.cse3 (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_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1)) |v_old(#valid)_AFTER_CALL_64|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (store |v_#valid_BEFORE_CALL_29| .cse2 (select |v_old(#valid)_AFTER_CALL_62| .cse2)) |v_old(#valid)_AFTER_CALL_62|) (= |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 .cse3) (and .cse3 (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse4 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_29| .cse4 (select |v_old(#valid)_AFTER_CALL_64| .cse4))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|)) (.cse6 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse5) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse6) (= (store |v_old(#valid)_AFTER_CALL_63| .cse5 (select |v_old(#valid)_AFTER_CALL_64| .cse5)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_#valid_BEFORE_CALL_29| .cse6 (select |v_old(#valid)_AFTER_CALL_63| .cse6)) |v_old(#valid)_AFTER_CALL_63|)))) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|)) (.cse8 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse7) (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse8 (select |v_old(#valid)_AFTER_CALL_63| .cse8)) |v_old(#valid)_AFTER_CALL_63|) (= (store |v_old(#valid)_AFTER_CALL_63| .cse7 (select |v_old(#valid)_AFTER_CALL_64| .cse7)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse8) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|)) (.cse11 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|)) (.cse10 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse9) (= (store |v_old(#valid)_AFTER_CALL_62| .cse10 (select |v_old(#valid)_AFTER_CALL_63| .cse10)) |v_old(#valid)_AFTER_CALL_63|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse11) (= (store |v_old(#valid)_AFTER_CALL_63| .cse9 (select |v_old(#valid)_AFTER_CALL_64| .cse9)) |v_old(#valid)_AFTER_CALL_64|) (= (store |v_#valid_BEFORE_CALL_29| .cse11 (select |v_old(#valid)_AFTER_CALL_62| .cse11)) |v_old(#valid)_AFTER_CALL_62|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse10) 1)))) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse12) (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse12 (select |v_old(#valid)_AFTER_CALL_64| .cse12)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse13 (select |v_old(#valid)_AFTER_CALL_64| .cse13)) |v_old(#valid)_AFTER_CALL_64|) (= (select |v_old(#valid)_AFTER_CALL_62| |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| .cse13) 1)))))))) is different from false [2024-11-28 04:32:43,450 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 (= |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|)) (let ((.cse3 (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_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1)) |v_old(#valid)_AFTER_CALL_64|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (store |v_#valid_BEFORE_CALL_29| .cse2 (select |v_old(#valid)_AFTER_CALL_62| .cse2)) |v_old(#valid)_AFTER_CALL_62|) (= |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 .cse3) (and .cse3 (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse4 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_29| .cse4 (select |v_old(#valid)_AFTER_CALL_64| .cse4))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|)) (.cse6 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse5) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse6) (= (store |v_old(#valid)_AFTER_CALL_63| .cse5 (select |v_old(#valid)_AFTER_CALL_64| .cse5)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_#valid_BEFORE_CALL_29| .cse6 (select |v_old(#valid)_AFTER_CALL_63| .cse6)) |v_old(#valid)_AFTER_CALL_63|)))) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|)) (.cse8 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse7) (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse8 (select |v_old(#valid)_AFTER_CALL_63| .cse8)) |v_old(#valid)_AFTER_CALL_63|) (= (store |v_old(#valid)_AFTER_CALL_63| .cse7 (select |v_old(#valid)_AFTER_CALL_64| .cse7)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse8) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|)) (.cse11 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|)) (.cse10 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse9) (= (store |v_old(#valid)_AFTER_CALL_62| .cse10 (select |v_old(#valid)_AFTER_CALL_63| .cse10)) |v_old(#valid)_AFTER_CALL_63|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse11) (= (store |v_old(#valid)_AFTER_CALL_63| .cse9 (select |v_old(#valid)_AFTER_CALL_64| .cse9)) |v_old(#valid)_AFTER_CALL_64|) (= (store |v_#valid_BEFORE_CALL_29| .cse11 (select |v_old(#valid)_AFTER_CALL_62| .cse11)) |v_old(#valid)_AFTER_CALL_62|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse10) 1)))) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse12) (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse12 (select |v_old(#valid)_AFTER_CALL_64| .cse12)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse13 (select |v_old(#valid)_AFTER_CALL_64| .cse13)) |v_old(#valid)_AFTER_CALL_64|) (= (select |v_old(#valid)_AFTER_CALL_62| |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| .cse13) 1)))))))) is different from true [2024-11-28 04:32:47,465 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (let ((.cse0 (exists ((v_ArrVal_5041 Int)) (= (select |c_#valid| v_ArrVal_5041) 1))) (.cse4 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1)) |v_old(#valid)_AFTER_CALL_64|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (store |v_#valid_BEFORE_CALL_29| .cse2 (select |v_old(#valid)_AFTER_CALL_62| .cse2)) |v_old(#valid)_AFTER_CALL_62|) (= |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)) .cse3 .cse0 .cse4) (and .cse0 .cse4 (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse5 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_29| .cse5 (select |v_old(#valid)_AFTER_CALL_64| .cse5))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse6 (select |v_old(#valid)_AFTER_CALL_64| .cse6)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse6) 1)))) .cse4) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse7 (select |v_old(#valid)_AFTER_CALL_64| .cse7)) |v_old(#valid)_AFTER_CALL_64|) (= (select |v_old(#valid)_AFTER_CALL_62| |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| .cse7) 1))))) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|)) (.cse8 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|)) (.cse10 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse8 (select |v_old(#valid)_AFTER_CALL_63| .cse8)) |v_old(#valid)_AFTER_CALL_63|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse9) (= (store |v_old(#valid)_AFTER_CALL_63| .cse10 (select |v_old(#valid)_AFTER_CALL_64| .cse10)) |v_old(#valid)_AFTER_CALL_64|) (= (store |v_#valid_BEFORE_CALL_29| .cse9 (select |v_old(#valid)_AFTER_CALL_62| .cse9)) |v_old(#valid)_AFTER_CALL_62|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse8) 1) (= (select |c_#valid| .cse10) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|)) (.cse12 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse11 (select |v_old(#valid)_AFTER_CALL_63| .cse11)) |v_old(#valid)_AFTER_CALL_63|) (= (store |v_old(#valid)_AFTER_CALL_63| .cse12 (select |v_old(#valid)_AFTER_CALL_64| .cse12)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse11) 1) (= (select |c_#valid| .cse12) 1)))) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|)) (.cse13 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse13) (= (store |v_old(#valid)_AFTER_CALL_63| .cse14 (select |v_old(#valid)_AFTER_CALL_64| .cse14)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse14) 1) (= (store |v_#valid_BEFORE_CALL_29| .cse13 (select |v_old(#valid)_AFTER_CALL_63| .cse13)) |v_old(#valid)_AFTER_CALL_63|)))) .cse4))) (or (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse3 (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|)))) is different from false [2024-11-28 04:32:47,477 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (let ((.cse0 (exists ((v_ArrVal_5041 Int)) (= (select |c_#valid| v_ArrVal_5041) 1))) (.cse4 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1)) |v_old(#valid)_AFTER_CALL_64|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (store |v_#valid_BEFORE_CALL_29| .cse2 (select |v_old(#valid)_AFTER_CALL_62| .cse2)) |v_old(#valid)_AFTER_CALL_62|) (= |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)) .cse3 .cse0 .cse4) (and .cse0 .cse4 (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse5 |c_ULTIMATE.start_l3_insert_~list#1.base|) (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_29| .cse5 (select |v_old(#valid)_AFTER_CALL_64| .cse5))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse6 (select |v_old(#valid)_AFTER_CALL_64| .cse6)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse6) 1)))) .cse4) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse7 (select |v_old(#valid)_AFTER_CALL_64| .cse7)) |v_old(#valid)_AFTER_CALL_64|) (= (select |v_old(#valid)_AFTER_CALL_62| |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| .cse7) 1))))) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|)) (.cse8 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|)) (.cse10 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse8 (select |v_old(#valid)_AFTER_CALL_63| .cse8)) |v_old(#valid)_AFTER_CALL_63|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse9) (= (store |v_old(#valid)_AFTER_CALL_63| .cse10 (select |v_old(#valid)_AFTER_CALL_64| .cse10)) |v_old(#valid)_AFTER_CALL_64|) (= (store |v_#valid_BEFORE_CALL_29| .cse9 (select |v_old(#valid)_AFTER_CALL_62| .cse9)) |v_old(#valid)_AFTER_CALL_62|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse8) 1) (= (select |c_#valid| .cse10) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|)) (.cse12 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse11 (select |v_old(#valid)_AFTER_CALL_63| .cse11)) |v_old(#valid)_AFTER_CALL_63|) (= (store |v_old(#valid)_AFTER_CALL_63| .cse12 (select |v_old(#valid)_AFTER_CALL_64| .cse12)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse11) 1) (= (select |c_#valid| .cse12) 1)))) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|)) (.cse13 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse13) (= (store |v_old(#valid)_AFTER_CALL_63| .cse14 (select |v_old(#valid)_AFTER_CALL_64| .cse14)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse14) 1) (= (store |v_#valid_BEFORE_CALL_29| .cse13 (select |v_old(#valid)_AFTER_CALL_63| .cse13)) |v_old(#valid)_AFTER_CALL_63|)))) .cse4))) (or (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse3 (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|)))) is different from true [2024-11-28 04:32:51,503 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) (let ((.cse7 (exists ((v_ArrVal_5041 Int)) (= (select |c_#valid| v_ArrVal_5041) 1))) (.cse4 (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_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|)) (.cse3 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse1 (select |v_old(#valid)_AFTER_CALL_63| .cse1)) |v_old(#valid)_AFTER_CALL_63|) (= (select |c_#valid| .cse2) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse3 (select |v_old(#valid)_AFTER_CALL_64| .cse3)) |v_old(#valid)_AFTER_CALL_64|) (= (store |v_#valid_BEFORE_CALL_29| .cse2 (select |v_old(#valid)_AFTER_CALL_62| .cse2)) |v_old(#valid)_AFTER_CALL_62|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| .cse3) 1)))) (and .cse4 (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|)) (.cse5 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |c_#valid| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse6 (select |v_old(#valid)_AFTER_CALL_64| .cse6)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse6) 1) (= (store |v_#valid_BEFORE_CALL_29| .cse5 (select |v_old(#valid)_AFTER_CALL_63| .cse5)) |v_old(#valid)_AFTER_CALL_63|))))) (and .cse7 .cse8 (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse9 (select |v_old(#valid)_AFTER_CALL_64| .cse9)) |v_old(#valid)_AFTER_CALL_64|) (= (select |v_old(#valid)_AFTER_CALL_62| |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| .cse9) 1))))) (and (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|)) (.cse11 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse10 (select |v_old(#valid)_AFTER_CALL_63| .cse10)) |v_old(#valid)_AFTER_CALL_63|) (= (store |v_old(#valid)_AFTER_CALL_63| .cse11 (select |v_old(#valid)_AFTER_CALL_64| .cse11)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse10) 1) (= (select |c_#valid| .cse11) 1)))) .cse8) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse12 (select |v_old(#valid)_AFTER_CALL_64| .cse12)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse12) 1)))) .cse4 .cse8) (and .cse7 .cse4 (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |c_#valid| .cse13) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_29| .cse13 (select |v_old(#valid)_AFTER_CALL_64| .cse13))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse15 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|)) (.cse14 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse14 (select |v_old(#valid)_AFTER_CALL_64| .cse14)) |v_old(#valid)_AFTER_CALL_64|) (= (select |c_#valid| .cse15) 1) (= (store |v_#valid_BEFORE_CALL_29| .cse15 (select |v_old(#valid)_AFTER_CALL_62| .cse15)) |v_old(#valid)_AFTER_CALL_62|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse14) 1)))) .cse7) (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 .cse7 .cse4 .cse8))))) is different from false [2024-11-28 04:32:51,516 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) (let ((.cse7 (exists ((v_ArrVal_5041 Int)) (= (select |c_#valid| v_ArrVal_5041) 1))) (.cse4 (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_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|)) (.cse3 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse1 (select |v_old(#valid)_AFTER_CALL_63| .cse1)) |v_old(#valid)_AFTER_CALL_63|) (= (select |c_#valid| .cse2) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse3 (select |v_old(#valid)_AFTER_CALL_64| .cse3)) |v_old(#valid)_AFTER_CALL_64|) (= (store |v_#valid_BEFORE_CALL_29| .cse2 (select |v_old(#valid)_AFTER_CALL_62| .cse2)) |v_old(#valid)_AFTER_CALL_62|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| .cse3) 1)))) (and .cse4 (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|)) (.cse5 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |c_#valid| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse6 (select |v_old(#valid)_AFTER_CALL_64| .cse6)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse6) 1) (= (store |v_#valid_BEFORE_CALL_29| .cse5 (select |v_old(#valid)_AFTER_CALL_63| .cse5)) |v_old(#valid)_AFTER_CALL_63|))))) (and .cse7 .cse8 (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse9 (select |v_old(#valid)_AFTER_CALL_64| .cse9)) |v_old(#valid)_AFTER_CALL_64|) (= (select |v_old(#valid)_AFTER_CALL_62| |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| .cse9) 1))))) (and (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|)) (.cse11 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse10 (select |v_old(#valid)_AFTER_CALL_63| .cse10)) |v_old(#valid)_AFTER_CALL_63|) (= (store |v_old(#valid)_AFTER_CALL_63| .cse11 (select |v_old(#valid)_AFTER_CALL_64| .cse11)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse10) 1) (= (select |c_#valid| .cse11) 1)))) .cse8) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse12 (select |v_old(#valid)_AFTER_CALL_64| .cse12)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse12) 1)))) .cse4 .cse8) (and .cse7 .cse4 (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |c_#valid| .cse13) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_29| .cse13 (select |v_old(#valid)_AFTER_CALL_64| .cse13))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse15 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|)) (.cse14 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse14 (select |v_old(#valid)_AFTER_CALL_64| .cse14)) |v_old(#valid)_AFTER_CALL_64|) (= (select |c_#valid| .cse15) 1) (= (store |v_#valid_BEFORE_CALL_29| .cse15 (select |v_old(#valid)_AFTER_CALL_62| .cse15)) |v_old(#valid)_AFTER_CALL_62|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse14) 1)))) .cse7) (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 .cse7 .cse4 .cse8))))) is different from true [2024-11-28 04:32:55,533 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and .cse0 (let ((.cse7 (exists ((v_ArrVal_5041 Int)) (= (select |c_#valid| v_ArrVal_5041) 1))) (.cse4 (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_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|)) (.cse3 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse1 (select |v_old(#valid)_AFTER_CALL_63| .cse1)) |v_old(#valid)_AFTER_CALL_63|) (= (select |c_#valid| .cse2) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse3 (select |v_old(#valid)_AFTER_CALL_64| .cse3)) |v_old(#valid)_AFTER_CALL_64|) (= (store |v_#valid_BEFORE_CALL_29| .cse2 (select |v_old(#valid)_AFTER_CALL_62| .cse2)) |v_old(#valid)_AFTER_CALL_62|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| .cse3) 1)))) (and .cse4 (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|)) (.cse5 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |c_#valid| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse6 (select |v_old(#valid)_AFTER_CALL_64| .cse6)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse6) 1) (= (store |v_#valid_BEFORE_CALL_29| .cse5 (select |v_old(#valid)_AFTER_CALL_63| .cse5)) |v_old(#valid)_AFTER_CALL_63|))))) (and .cse7 .cse8 (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse9 (select |v_old(#valid)_AFTER_CALL_64| .cse9)) |v_old(#valid)_AFTER_CALL_64|) (= (select |v_old(#valid)_AFTER_CALL_62| |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| .cse9) 1))))) (and (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|)) (.cse11 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse10 (select |v_old(#valid)_AFTER_CALL_63| .cse10)) |v_old(#valid)_AFTER_CALL_63|) (= (store |v_old(#valid)_AFTER_CALL_63| .cse11 (select |v_old(#valid)_AFTER_CALL_64| .cse11)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse10) 1) (= (select |c_#valid| .cse11) 1)))) .cse8) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse12 (select |v_old(#valid)_AFTER_CALL_64| .cse12)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse12) 1)))) .cse4 .cse8) (and .cse7 .cse4 (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |c_#valid| .cse13) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_29| .cse13 (select |v_old(#valid)_AFTER_CALL_64| .cse13))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse15 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|)) (.cse14 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse14 (select |v_old(#valid)_AFTER_CALL_64| .cse14)) |v_old(#valid)_AFTER_CALL_64|) (= (select |c_#valid| .cse15) 1) (= (store |v_#valid_BEFORE_CALL_29| .cse15 (select |v_old(#valid)_AFTER_CALL_62| .cse15)) |v_old(#valid)_AFTER_CALL_62|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse14) 1)))) .cse7) (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 .cse7 .cse4 .cse8))))) is different from false [2024-11-28 04:32:55,545 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and .cse0 (let ((.cse7 (exists ((v_ArrVal_5041 Int)) (= (select |c_#valid| v_ArrVal_5041) 1))) (.cse4 (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_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|)) (.cse3 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse1 (select |v_old(#valid)_AFTER_CALL_63| .cse1)) |v_old(#valid)_AFTER_CALL_63|) (= (select |c_#valid| .cse2) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse3 (select |v_old(#valid)_AFTER_CALL_64| .cse3)) |v_old(#valid)_AFTER_CALL_64|) (= (store |v_#valid_BEFORE_CALL_29| .cse2 (select |v_old(#valid)_AFTER_CALL_62| .cse2)) |v_old(#valid)_AFTER_CALL_62|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| .cse3) 1)))) (and .cse4 (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|)) (.cse5 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |c_#valid| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse6 (select |v_old(#valid)_AFTER_CALL_64| .cse6)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse6) 1) (= (store |v_#valid_BEFORE_CALL_29| .cse5 (select |v_old(#valid)_AFTER_CALL_63| .cse5)) |v_old(#valid)_AFTER_CALL_63|))))) (and .cse7 .cse8 (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_old(#valid)_AFTER_CALL_62| .cse9 (select |v_old(#valid)_AFTER_CALL_64| .cse9)) |v_old(#valid)_AFTER_CALL_64|) (= (select |v_old(#valid)_AFTER_CALL_62| |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| .cse9) 1))))) (and (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_63|)) (.cse11 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse10 (select |v_old(#valid)_AFTER_CALL_63| .cse10)) |v_old(#valid)_AFTER_CALL_63|) (= (store |v_old(#valid)_AFTER_CALL_63| .cse11 (select |v_old(#valid)_AFTER_CALL_64| .cse11)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse10) 1) (= (select |c_#valid| .cse11) 1)))) .cse8) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse12 (select |v_old(#valid)_AFTER_CALL_64| .cse12)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse12) 1)))) .cse4 .cse8) (and .cse7 .cse4 (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |c_#valid| .cse13) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_64| (store |v_#valid_BEFORE_CALL_29| .cse13 (select |v_old(#valid)_AFTER_CALL_64| .cse13))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse15 (@diff |v_#valid_BEFORE_CALL_29| |v_old(#valid)_AFTER_CALL_62|)) (.cse14 (@diff |v_old(#valid)_AFTER_CALL_62| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_62| .cse14 (select |v_old(#valid)_AFTER_CALL_64| .cse14)) |v_old(#valid)_AFTER_CALL_64|) (= (select |c_#valid| .cse15) 1) (= (store |v_#valid_BEFORE_CALL_29| .cse15 (select |v_old(#valid)_AFTER_CALL_62| .cse15)) |v_old(#valid)_AFTER_CALL_62|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse14) 1)))) .cse7) (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 .cse7 .cse4 .cse8))))) is different from true [2024-11-28 04:32:57,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:32:57,823 INFO L93 Difference]: Finished difference Result 216 states and 239 transitions. [2024-11-28 04:32:57,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-28 04:32:57,824 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 35 states have (on average 2.6857142857142855) internal successors, (94), 31 states have internal predecessors, (94), 8 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Word has length 132 [2024-11-28 04:32:57,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:32:57,827 INFO L225 Difference]: With dead ends: 216 [2024-11-28 04:32:57,827 INFO L226 Difference]: Without dead ends: 216 [2024-11-28 04:32:57,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 141 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 28 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 62.4s TimeCoverageRelationStatistics Valid=190, Invalid=1057, Unknown=55, NotChecked=2604, Total=3906 [2024-11-28 04:32:57,830 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 16 mSDsluCounter, 1873 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2043 SdHoareTripleChecker+Invalid, 5115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3707 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:32:57,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2043 Invalid, 5115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1383 Invalid, 0 Unknown, 3707 Unchecked, 2.7s Time] [2024-11-28 04:32:57,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-28 04:32:57,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2024-11-28 04:32:57,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 147 states have (on average 1.489795918367347) internal successors, (219), 203 states have internal predecessors, (219), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-28 04:32:57,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 239 transitions. [2024-11-28 04:32:57,875 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 239 transitions. Word has length 132 [2024-11-28 04:32:57,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:32:57,876 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 239 transitions. [2024-11-28 04:32:57,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 35 states have (on average 2.6857142857142855) internal successors, (94), 31 states have internal predecessors, (94), 8 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-28 04:32:57,877 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 239 transitions. [2024-11-28 04:32:57,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-28 04:32:57,888 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:32:57,888 INFO L218 NwaCegarLoop]: trace histogram [45, 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-28 04:32:57,909 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-28 04:32:58,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:32:58,089 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 04:32:58,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:32:58,090 INFO L85 PathProgramCache]: Analyzing trace with hash 161574842, now seen corresponding path program 1 times [2024-11-28 04:32:58,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:32:58,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057337455] [2024-11-28 04:32:58,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:32:58,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:32:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:33:04,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 504 proven. 627 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-28 04:33:04,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:33:04,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057337455] [2024-11-28 04:33:04,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057337455] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:33:04,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872733906] [2024-11-28 04:33:04,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:33:04,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:33:04,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:33:04,520 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:33:04,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 04:33:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:33:06,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 1311 conjuncts, 194 conjuncts are in the unsatisfiable core [2024-11-28 04:33:06,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:33:06,923 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-28 04:33:06,938 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-28 04:33:25,942 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 04:33:25,943 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-28 04:33:25,994 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-28 04:33:28,908 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-11-28 04:33:28,909 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-28 04:33:28,951 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-28 04:33:31,721 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 04:33:31,722 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-28 04:33:31,857 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2024-11-28 04:33:31,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2024-11-28 04:33:32,957 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-28 04:33:33,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:33:33,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-28 04:33:33,202 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-28 04:33:33,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 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-28 04:33:34,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 152 proven. 862 refuted. 0 times theorem prover too weak. 89 trivial. 292 not checked. [2024-11-28 04:33:34,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:33:35,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872733906] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:33:35,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:33:35,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 56] total 78 [2024-11-28 04:33:35,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523433936] [2024-11-28 04:33:35,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:33:35,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2024-11-28 04:33:35,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:33:35,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2024-11-28 04:33:35,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=6000, Unknown=3, NotChecked=156, Total=6480 [2024-11-28 04:33:35,251 INFO L87 Difference]: Start difference. First operand 216 states and 239 transitions. Second operand has 79 states, 74 states have (on average 2.0675675675675675) internal successors, (153), 73 states have internal predecessors, (153), 6 states have call successors, (10), 2 states have call predecessors, (10), 8 states have return successors, (11), 9 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-28 04:33:39,573 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-28 04:33:45,333 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-28 04:33:50,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-28 04:33:54,751 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-28 04:33:59,250 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-28 04:34:04,333 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-28 04:34:09,528 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-28 04:34:14,505 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-28 04:34:19,331 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-28 04:34:24,467 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-28 04:34:30,160 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-28 04:34:58,119 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-28 04:35:02,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:35:02,753 INFO L93 Difference]: Finished difference Result 299 states and 359 transitions. [2024-11-28 04:35:02,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-28 04:35:02,755 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 74 states have (on average 2.0675675675675675) internal successors, (153), 73 states have internal predecessors, (153), 6 states have call successors, (10), 2 states have call predecessors, (10), 8 states have return successors, (11), 9 states have call predecessors, (11), 6 states have call successors, (11) Word has length 132 [2024-11-28 04:35:02,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:35:02,763 INFO L225 Difference]: With dead ends: 299 [2024-11-28 04:35:02,766 INFO L226 Difference]: Without dead ends: 299 [2024-11-28 04:35:02,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3246 ImplicationChecksByTransitivity, 51.1s TimeCoverageRelationStatistics Valid=767, Invalid=12116, Unknown=3, NotChecked=224, Total=13110 [2024-11-28 04:35:02,774 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 259 mSDsluCounter, 3894 mSDsCounter, 0 mSdLazyCounter, 4255 mSolverCounterSat, 59 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 62.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 4042 SdHoareTripleChecker+Invalid, 4554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 4255 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 228 IncrementalHoareTripleChecker+Unchecked, 63.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:35:02,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 4042 Invalid, 4554 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [59 Valid, 4255 Invalid, 12 Unknown, 228 Unchecked, 63.3s Time] [2024-11-28 04:35:02,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-28 04:35:02,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 182. [2024-11-28 04:35:02,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 123 states have (on average 1.5040650406504066) internal successors, (185), 173 states have internal predecessors, (185), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:35:02,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 197 transitions. [2024-11-28 04:35:02,826 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 197 transitions. Word has length 132 [2024-11-28 04:35:02,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:35:02,827 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 197 transitions. [2024-11-28 04:35:02,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 74 states have (on average 2.0675675675675675) internal successors, (153), 73 states have internal predecessors, (153), 6 states have call successors, (10), 2 states have call predecessors, (10), 8 states have return successors, (11), 9 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-28 04:35:02,827 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 197 transitions. [2024-11-28 04:35:02,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-28 04:35:02,839 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:35:02,839 INFO L218 NwaCegarLoop]: trace histogram [45, 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-28 04:35:02,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-28 04:35:03,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-28 04:35:03,041 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 04:35:03,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:35:03,041 INFO L85 PathProgramCache]: Analyzing trace with hash 467139589, now seen corresponding path program 1 times [2024-11-28 04:35:03,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:35:03,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115426557] [2024-11-28 04:35:03,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:35:03,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:35:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:35:07,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 290 proven. 372 refuted. 0 times theorem prover too weak. 733 trivial. 0 not checked. [2024-11-28 04:35:07,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:35:07,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115426557] [2024-11-28 04:35:07,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115426557] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:35:07,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544759706] [2024-11-28 04:35:07,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:35:07,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:35:07,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:35:07,680 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:35:07,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 04:35:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:35:08,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 1356 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-11-28 04:35:08,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:35:08,609 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-28 04:35:08,806 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 04:35:08,806 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-28 04:35:09,314 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 04:35:09,315 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-28 04:35:09,653 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 04:35:09,653 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-28 04:35:09,996 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_51| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_51| |c_#valid|))) (and (= .cse0 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= (select |v_#valid_BEFORE_CALL_51| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_51| .cse0 (select |c_#valid| .cse0))))))) is different from false [2024-11-28 04:35:10,001 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_51| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_51| |c_#valid|))) (and (= .cse0 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= (select |v_#valid_BEFORE_CALL_51| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_51| .cse0 (select |c_#valid| .cse0))))))) is different from true [2024-11-28 04:35:10,027 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_51| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_51| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_51| .cse0 (select |c_#valid| .cse0))))))) is different from false [2024-11-28 04:35:10,032 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_51| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_51| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_51| .cse0 (select |c_#valid| .cse0))))))) is different from true [2024-11-28 04:35:10,146 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-28 04:35:10,246 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 04:35:10,247 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-28 04:35:10,291 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_l1_insert_~list#1.base|) 1)) (exists ((|v_#valid_BEFORE_CALL_53| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_51| |v_#valid_BEFORE_CALL_53|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_51| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_53| (store |v_#valid_BEFORE_CALL_51| .cse0 (select |v_#valid_BEFORE_CALL_53| .cse0)))))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_53| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) is different from false [2024-11-28 04:35:10,299 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_l1_insert_~list#1.base|) 1)) (exists ((|v_#valid_BEFORE_CALL_53| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_51| |v_#valid_BEFORE_CALL_53|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_51| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_53| (store |v_#valid_BEFORE_CALL_51| .cse0 (select |v_#valid_BEFORE_CALL_53| .cse0)))))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_53| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) is different from true [2024-11-28 04:35:10,359 WARN L851 $PredicateComparison]: unable to prove that (and (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_l1_insert_~list#1.base|) 1)) (exists ((|v_#valid_BEFORE_CALL_53| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_51| |v_#valid_BEFORE_CALL_53|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_51| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_53| (store |v_#valid_BEFORE_CALL_51| .cse0 (select |v_#valid_BEFORE_CALL_53| .cse0)))))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_53| |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-28 04:35:10,365 WARN L873 $PredicateComparison]: unable to prove that (and (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_l1_insert_~list#1.base|) 1)) (exists ((|v_#valid_BEFORE_CALL_53| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_51| |v_#valid_BEFORE_CALL_53|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_51| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_53| (store |v_#valid_BEFORE_CALL_51| .cse0 (select |v_#valid_BEFORE_CALL_53| .cse0)))))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_53| |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-28 04:35:10,608 WARN L851 $PredicateComparison]: unable to prove that (or (and (exists ((v_ArrVal_6335 Int)) (= (select |c_#valid| v_ArrVal_6335) 1)) (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_#valid_BEFORE_CALL_51| (Array Int Int)) (|v_#valid_BEFORE_CALL_53| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_51| |v_#valid_BEFORE_CALL_53|))) (and (= (select |v_#valid_BEFORE_CALL_51| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_53| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse0) 1) (= |v_#valid_BEFORE_CALL_53| (store |v_#valid_BEFORE_CALL_51| .cse0 (select |v_#valid_BEFORE_CALL_53| .cse0))))))) is different from false [2024-11-28 04:35:10,612 WARN L873 $PredicateComparison]: unable to prove that (or (and (exists ((v_ArrVal_6335 Int)) (= (select |c_#valid| v_ArrVal_6335) 1)) (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_#valid_BEFORE_CALL_51| (Array Int Int)) (|v_#valid_BEFORE_CALL_53| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_51| |v_#valid_BEFORE_CALL_53|))) (and (= (select |v_#valid_BEFORE_CALL_51| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_53| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse0) 1) (= |v_#valid_BEFORE_CALL_53| (store |v_#valid_BEFORE_CALL_51| .cse0 (select |v_#valid_BEFORE_CALL_53| .cse0))))))) is different from true [2024-11-28 04:35:11,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 5 proven. 444 refuted. 0 times theorem prover too weak. 293 trivial. 653 not checked. [2024-11-28 04:35:11,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:35:11,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544759706] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:35:11,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:35:11,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 30] total 42 [2024-11-28 04:35:11,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607110704] [2024-11-28 04:35:11,642 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:35:11,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-28 04:35:11,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:35:11,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-28 04:35:11,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1239, Unknown=12, NotChecked=546, Total=1980 [2024-11-28 04:35:11,645 INFO L87 Difference]: Start difference. First operand 182 states and 197 transitions. Second operand has 43 states, 40 states have (on average 2.925) internal successors, (117), 33 states have internal predecessors, (117), 7 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 11 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-28 04:35:13,214 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) (or .cse0 (exists ((|v_#valid_BEFORE_CALL_51| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_51| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= (select |v_#valid_BEFORE_CALL_51| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_51| .cse1 (select |c_#valid| .cse1))))))) (not (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)) .cse0 (not (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|)))) is different from false [2024-11-28 04:35:13,219 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) (or .cse0 (exists ((|v_#valid_BEFORE_CALL_51| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_51| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= (select |v_#valid_BEFORE_CALL_51| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_51| .cse1 (select |c_#valid| .cse1))))))) (not (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)) .cse0 (not (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|)))) is different from true [2024-11-28 04:35:13,227 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_51| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_51| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_51| .cse1 (select |c_#valid| .cse1))))))) (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0 (= |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-28 04:35:13,232 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_51| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_51| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_51| .cse1 (select |c_#valid| .cse1))))))) (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0 (= |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-28 04:35:13,239 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (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 ((|v_#valid_BEFORE_CALL_53| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_51| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_51| |v_#valid_BEFORE_CALL_53|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_51| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_53| (store |v_#valid_BEFORE_CALL_51| .cse1 (select |v_#valid_BEFORE_CALL_53| .cse1)))))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_53| |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|) .cse0 (= |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-28 04:35:13,244 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (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 ((|v_#valid_BEFORE_CALL_53| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_51| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_51| |v_#valid_BEFORE_CALL_53|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_51| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_53| (store |v_#valid_BEFORE_CALL_51| .cse1 (select |v_#valid_BEFORE_CALL_53| .cse1)))))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_53| |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|) .cse0 (= |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-28 04:35:13,250 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (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 ((|v_#valid_BEFORE_CALL_53| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_51| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_51| |v_#valid_BEFORE_CALL_53|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_51| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_53| (store |v_#valid_BEFORE_CALL_51| .cse1 (select |v_#valid_BEFORE_CALL_53| .cse1)))))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_53| |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|) .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|)))) is different from false [2024-11-28 04:35:13,255 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (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 ((|v_#valid_BEFORE_CALL_53| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_51| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_51| |v_#valid_BEFORE_CALL_53|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_51| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |v_#valid_BEFORE_CALL_53| (store |v_#valid_BEFORE_CALL_51| .cse1 (select |v_#valid_BEFORE_CALL_53| .cse1)))))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_53| |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|) .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|)))) is different from true [2024-11-28 04:35:13,262 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (and (exists ((v_ArrVal_6335 Int)) (= (select |c_#valid| v_ArrVal_6335) 1)) (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 ((|v_#valid_BEFORE_CALL_51| (Array Int Int)) (|v_#valid_BEFORE_CALL_53| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_51| |v_#valid_BEFORE_CALL_53|))) (and (= (select |v_#valid_BEFORE_CALL_51| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_53| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse1) 1) (= |v_#valid_BEFORE_CALL_53| (store |v_#valid_BEFORE_CALL_51| .cse1 (select |v_#valid_BEFORE_CALL_53| .cse1))))))) (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|)))) is different from false [2024-11-28 04:35:13,267 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (and (exists ((v_ArrVal_6335 Int)) (= (select |c_#valid| v_ArrVal_6335) 1)) (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 ((|v_#valid_BEFORE_CALL_51| (Array Int Int)) (|v_#valid_BEFORE_CALL_53| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_51| |v_#valid_BEFORE_CALL_53|))) (and (= (select |v_#valid_BEFORE_CALL_51| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_53| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse1) 1) (= |v_#valid_BEFORE_CALL_53| (store |v_#valid_BEFORE_CALL_51| .cse1 (select |v_#valid_BEFORE_CALL_53| .cse1))))))) (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|)))) is different from true [2024-11-28 04:35:13,283 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 (and (exists ((v_ArrVal_6335 Int)) (= (select |c_#valid| v_ArrVal_6335) 1)) (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 ((|v_#valid_BEFORE_CALL_51| (Array Int Int)) (|v_#valid_BEFORE_CALL_53| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_51| |v_#valid_BEFORE_CALL_53|))) (and (= (select |v_#valid_BEFORE_CALL_51| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_53| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse1) 1) (= |v_#valid_BEFORE_CALL_53| (store |v_#valid_BEFORE_CALL_51| .cse1 (select |v_#valid_BEFORE_CALL_53| .cse1))))))))) is different from false [2024-11-28 04:35:13,288 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 (and (exists ((v_ArrVal_6335 Int)) (= (select |c_#valid| v_ArrVal_6335) 1)) (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 ((|v_#valid_BEFORE_CALL_51| (Array Int Int)) (|v_#valid_BEFORE_CALL_53| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_51| |v_#valid_BEFORE_CALL_53|))) (and (= (select |v_#valid_BEFORE_CALL_51| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_53| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse1) 1) (= |v_#valid_BEFORE_CALL_53| (store |v_#valid_BEFORE_CALL_51| .cse1 (select |v_#valid_BEFORE_CALL_53| .cse1))))))))) is different from true [2024-11-28 04:35:13,302 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (and (exists ((v_ArrVal_6335 Int)) (= (select |c_#valid| v_ArrVal_6335) 1)) (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 ((|v_#valid_BEFORE_CALL_51| (Array Int Int)) (|v_#valid_BEFORE_CALL_53| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_51| |v_#valid_BEFORE_CALL_53|))) (and (= (select |v_#valid_BEFORE_CALL_51| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_53| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse1) 1) (= |v_#valid_BEFORE_CALL_53| (store |v_#valid_BEFORE_CALL_51| .cse1 (select |v_#valid_BEFORE_CALL_53| .cse1))))))) (or .cse0 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)))) is different from false [2024-11-28 04:35:13,308 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (and (exists ((v_ArrVal_6335 Int)) (= (select |c_#valid| v_ArrVal_6335) 1)) (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 ((|v_#valid_BEFORE_CALL_51| (Array Int Int)) (|v_#valid_BEFORE_CALL_53| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_51| |v_#valid_BEFORE_CALL_53|))) (and (= (select |v_#valid_BEFORE_CALL_51| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_53| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse1) 1) (= |v_#valid_BEFORE_CALL_53| (store |v_#valid_BEFORE_CALL_51| .cse1 (select |v_#valid_BEFORE_CALL_53| .cse1))))))) (or .cse0 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)))) is different from true [2024-11-28 04:35:13,320 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and .cse0 (or (and (exists ((v_ArrVal_6335 Int)) (= (select |c_#valid| v_ArrVal_6335) 1)) (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 ((|v_#valid_BEFORE_CALL_51| (Array Int Int)) (|v_#valid_BEFORE_CALL_53| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_51| |v_#valid_BEFORE_CALL_53|))) (and (= (select |v_#valid_BEFORE_CALL_51| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_53| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse1) 1) (= |v_#valid_BEFORE_CALL_53| (store |v_#valid_BEFORE_CALL_51| .cse1 (select |v_#valid_BEFORE_CALL_53| .cse1))))))))) is different from false [2024-11-28 04:35:13,325 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and .cse0 (or (and (exists ((v_ArrVal_6335 Int)) (= (select |c_#valid| v_ArrVal_6335) 1)) (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 ((|v_#valid_BEFORE_CALL_51| (Array Int Int)) (|v_#valid_BEFORE_CALL_53| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_51| |v_#valid_BEFORE_CALL_53|))) (and (= (select |v_#valid_BEFORE_CALL_51| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_53| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse1) 1) (= |v_#valid_BEFORE_CALL_53| (store |v_#valid_BEFORE_CALL_51| .cse1 (select |v_#valid_BEFORE_CALL_53| .cse1))))))))) is different from true [2024-11-28 04:35:15,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:35:15,726 INFO L93 Difference]: Finished difference Result 219 states and 244 transitions. [2024-11-28 04:35:15,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-28 04:35:15,727 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 40 states have (on average 2.925) internal successors, (117), 33 states have internal predecessors, (117), 7 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 11 states have call predecessors, (11), 7 states have call successors, (11) Word has length 138 [2024-11-28 04:35:15,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:35:15,729 INFO L225 Difference]: With dead ends: 219 [2024-11-28 04:35:15,729 INFO L226 Difference]: Without dead ends: 219 [2024-11-28 04:35:15,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 163 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=318, Invalid=1876, Unknown=28, NotChecked=1560, Total=3782 [2024-11-28 04:35:15,732 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 28 mSDsluCounter, 1912 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2069 SdHoareTripleChecker+Invalid, 4185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2471 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:35:15,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2069 Invalid, 4185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1665 Invalid, 0 Unknown, 2471 Unchecked, 3.2s Time] [2024-11-28 04:35:15,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-28 04:35:15,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-11-28 04:35:15,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 155 states have (on average 1.4322580645161291) internal successors, (222), 205 states have internal predecessors, (222), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 04:35:15,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 244 transitions. [2024-11-28 04:35:15,761 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 244 transitions. Word has length 138 [2024-11-28 04:35:15,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:35:15,765 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 244 transitions. [2024-11-28 04:35:15,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 40 states have (on average 2.925) internal successors, (117), 33 states have internal predecessors, (117), 7 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 11 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-28 04:35:15,766 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 244 transitions. [2024-11-28 04:35:15,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-28 04:35:15,768 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:35:15,768 INFO L218 NwaCegarLoop]: trace histogram [45, 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-28 04:35:15,794 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-28 04:35:15,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-28 04:35:15,969 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 04:35:15,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:35:15,970 INFO L85 PathProgramCache]: Analyzing trace with hash 467139590, now seen corresponding path program 1 times [2024-11-28 04:35:15,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:35:15,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396729606] [2024-11-28 04:35:15,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:35:15,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:35:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:35:26,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 9 proven. 1129 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2024-11-28 04:35:26,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:35:26,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396729606] [2024-11-28 04:35:26,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396729606] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:35:26,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964086395] [2024-11-28 04:35:26,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:35:26,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:35:26,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:35:26,549 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:35:26,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-28 04:35:28,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:35:28,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 1356 conjuncts, 204 conjuncts are in the unsatisfiable core [2024-11-28 04:35:28,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:35:28,727 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-28 04:36:06,169 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 04:36:06,169 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-28 04:36:06,236 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 04:36:06,236 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-28 04:36:07,171 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 04:36:07,171 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-28 04:36:07,270 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-11-28 04:36:07,271 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-28 04:36:09,435 INFO L349 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2024-11-28 04:36:09,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 30 [2024-11-28 04:36:09,522 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 04:36:09,522 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-28 04:36:12,549 INFO L349 Elim1Store]: treesize reduction 80, result has 20.8 percent of original size [2024-11-28 04:36:12,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 27 treesize of output 38 [2024-11-28 04:36:12,637 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 04:36:12,638 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-28 04:36:13,439 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-28 04:36:13,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:36:13,573 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 21 treesize of output 16 [2024-11-28 04:36:13,702 INFO L349 Elim1Store]: treesize reduction 76, result has 21.6 percent of original size [2024-11-28 04:36:13,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 31 treesize of output 39 [2024-11-28 04:36:15,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 77 proven. 776 refuted. 0 times theorem prover too weak. 237 trivial. 305 not checked. [2024-11-28 04:36:15,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:36:16,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964086395] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:36:16,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:36:16,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 53] total 81 [2024-11-28 04:36:16,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112666115] [2024-11-28 04:36:16,821 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:36:16,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2024-11-28 04:36:16,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:36:16,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2024-11-28 04:36:16,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=6798, Unknown=8, NotChecked=166, Total=7310 [2024-11-28 04:36:16,825 INFO L87 Difference]: Start difference. First operand 219 states and 244 transitions. Second operand has 82 states, 77 states have (on average 2.103896103896104) internal successors, (162), 74 states have internal predecessors, (162), 8 states have call successors, (10), 2 states have call predecessors, (10), 8 states have return successors, (11), 10 states have call predecessors, (11), 8 states have call successors, (11) [2024-11-28 04:36:28,084 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-28 04:36:40,117 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-28 04:36:49,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:36:49,407 INFO L93 Difference]: Finished difference Result 225 states and 255 transitions. [2024-11-28 04:36:49,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-28 04:36:49,409 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 77 states have (on average 2.103896103896104) internal successors, (162), 74 states have internal predecessors, (162), 8 states have call successors, (10), 2 states have call predecessors, (10), 8 states have return successors, (11), 10 states have call predecessors, (11), 8 states have call successors, (11) Word has length 138 [2024-11-28 04:36:49,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:36:49,411 INFO L225 Difference]: With dead ends: 225 [2024-11-28 04:36:49,412 INFO L226 Difference]: Without dead ends: 225 [2024-11-28 04:36:49,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3588 ImplicationChecksByTransitivity, 57.3s TimeCoverageRelationStatistics Valid=884, Invalid=12452, Unknown=8, NotChecked=228, Total=13572 [2024-11-28 04:36:49,418 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 213 mSDsluCounter, 3489 mSDsCounter, 0 mSdLazyCounter, 5213 mSolverCounterSat, 36 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 3617 SdHoareTripleChecker+Invalid, 5415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 5213 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 23.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:36:49,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 3617 Invalid, 5415 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [36 Valid, 5213 Invalid, 2 Unknown, 164 Unchecked, 23.1s Time] [2024-11-28 04:36:49,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-28 04:36:49,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 176. [2024-11-28 04:36:49,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 123 states have (on average 1.4552845528455285) internal successors, (179), 167 states have internal predecessors, (179), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:36:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 191 transitions. [2024-11-28 04:36:49,440 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 191 transitions. Word has length 138 [2024-11-28 04:36:49,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:36:49,441 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 191 transitions. [2024-11-28 04:36:49,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 77 states have (on average 2.103896103896104) internal successors, (162), 74 states have internal predecessors, (162), 8 states have call successors, (10), 2 states have call predecessors, (10), 8 states have return successors, (11), 10 states have call predecessors, (11), 8 states have call successors, (11) [2024-11-28 04:36:49,441 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 191 transitions. [2024-11-28 04:36:49,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-28 04:36:49,443 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:36:49,444 INFO L218 NwaCegarLoop]: trace histogram [45, 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-28 04:36:49,484 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-28 04:36:49,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-28 04:36:49,645 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 04:36:49,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:36:49,645 INFO L85 PathProgramCache]: Analyzing trace with hash -279531726, now seen corresponding path program 1 times [2024-11-28 04:36:49,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:36:49,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732554697] [2024-11-28 04:36:49,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:36:49,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:36:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:36:58,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 88 proven. 1009 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-11-28 04:36:58,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:36:58,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732554697] [2024-11-28 04:36:58,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732554697] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:36:58,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983710702] [2024-11-28 04:36:58,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:36:58,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:36:58,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:36:58,324 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:36:58,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-28 04:36:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:36:59,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 1401 conjuncts, 130 conjuncts are in the unsatisfiable core [2024-11-28 04:36:59,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:36:59,942 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-28 04:37:00,315 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 04:37:00,315 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-28 04:37:00,324 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-28 04:37:00,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:37:00,708 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-28 04:37:00,764 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 04:37:00,764 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-28 04:37:01,715 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 04:37:01,715 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-28 04:37:01,767 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 04:37:01,768 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-28 04:37:03,298 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-28 04:37:03,298 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-28 04:37:03,363 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 04:37:03,363 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-28 04:37:04,215 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 04:37:04,216 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-28 04:37:04,340 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-11-28 04:37:04,341 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 23 treesize of output 37 [2024-11-28 04:37:04,951 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-28 04:37:05,133 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 04:37:05,133 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 24 treesize of output 23 [2024-11-28 04:37:05,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:37:05,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 45 [2024-11-28 04:37:08,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 88 proven. 88 refuted. 0 times theorem prover too weak. 386 trivial. 833 not checked. [2024-11-28 04:37:08,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:37:10,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983710702] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:37:10,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:37:10,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 25] total 55 [2024-11-28 04:37:10,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627687274] [2024-11-28 04:37:10,425 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:37:10,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-28 04:37:10,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:37:10,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-28 04:37:10,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=3329, Unknown=2, NotChecked=234, Total=3782 [2024-11-28 04:37:10,427 INFO L87 Difference]: Start difference. First operand 176 states and 191 transitions. Second operand has 57 states, 53 states have (on average 2.943396226415094) internal successors, (156), 46 states have internal predecessors, (156), 8 states have call successors, (12), 3 states have call predecessors, (12), 8 states have return successors, (12), 11 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-28 04:37:20,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:37:20,140 INFO L93 Difference]: Finished difference Result 203 states and 222 transitions. [2024-11-28 04:37:20,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-28 04:37:20,141 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 53 states have (on average 2.943396226415094) internal successors, (156), 46 states have internal predecessors, (156), 8 states have call successors, (12), 3 states have call predecessors, (12), 8 states have return successors, (12), 11 states have call predecessors, (12), 8 states have call successors, (12) Word has length 144 [2024-11-28 04:37:20,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:37:20,143 INFO L225 Difference]: With dead ends: 203 [2024-11-28 04:37:20,143 INFO L226 Difference]: Without dead ends: 203 [2024-11-28 04:37:20,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1505 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=643, Invalid=5525, Unknown=2, NotChecked=310, Total=6480 [2024-11-28 04:37:20,145 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 416 mSDsluCounter, 2636 mSDsCounter, 0 mSdLazyCounter, 3096 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 2751 SdHoareTripleChecker+Invalid, 3549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 3096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 382 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:37:20,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 2751 Invalid, 3549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 3096 Invalid, 0 Unknown, 382 Unchecked, 6.6s Time] [2024-11-28 04:37:20,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-28 04:37:20,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 170. [2024-11-28 04:37:20,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 123 states have (on average 1.4065040650406504) internal successors, (173), 161 states have internal predecessors, (173), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:37:20,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 185 transitions. [2024-11-28 04:37:20,155 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 185 transitions. Word has length 144 [2024-11-28 04:37:20,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:37:20,156 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 185 transitions. [2024-11-28 04:37:20,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 53 states have (on average 2.943396226415094) internal successors, (156), 46 states have internal predecessors, (156), 8 states have call successors, (12), 3 states have call predecessors, (12), 8 states have return successors, (12), 11 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-28 04:37:20,157 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 185 transitions. [2024-11-28 04:37:20,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-28 04:37:20,161 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:37:20,161 INFO L218 NwaCegarLoop]: trace histogram [45, 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] [2024-11-28 04:37:20,180 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-28 04:37:20,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-28 04:37:20,362 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 04:37:20,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:37:20,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1084856065, now seen corresponding path program 1 times [2024-11-28 04:37:20,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:37:20,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701005516] [2024-11-28 04:37:20,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:37:20,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:37:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:37:21,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2024-11-28 04:37:21,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:37:21,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701005516] [2024-11-28 04:37:21,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701005516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:37:21,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:37:21,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:37:21,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779650504] [2024-11-28 04:37:21,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:37:21,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:37:21,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:37:21,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:37:21,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:37:21,175 INFO L87 Difference]: Start difference. First operand 170 states and 185 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-28 04:37:22,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:37:22,190 INFO L93 Difference]: Finished difference Result 291 states and 316 transitions. [2024-11-28 04:37:22,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 04:37:22,191 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 152 [2024-11-28 04:37:22,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:37:22,192 INFO L225 Difference]: With dead ends: 291 [2024-11-28 04:37:22,193 INFO L226 Difference]: Without dead ends: 291 [2024-11-28 04:37:22,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:37:22,194 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 134 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 04:37:22,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 688 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 04:37:22,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-28 04:37:22,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 170. [2024-11-28 04:37:22,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 124 states have (on average 1.403225806451613) internal successors, (174), 161 states have internal predecessors, (174), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:37:22,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 186 transitions. [2024-11-28 04:37:22,202 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 186 transitions. Word has length 152 [2024-11-28 04:37:22,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:37:22,203 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 186 transitions. [2024-11-28 04:37:22,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-28 04:37:22,203 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 186 transitions. [2024-11-28 04:37:22,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-28 04:37:22,204 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:37:22,204 INFO L218 NwaCegarLoop]: trace histogram [45, 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] [2024-11-28 04:37:22,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 04:37:22,205 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 04:37:22,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:37:22,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1084856066, now seen corresponding path program 1 times [2024-11-28 04:37:22,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:37:22,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995348068] [2024-11-28 04:37:22,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:37:22,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:37:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:37:24,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 0 proven. 413 refuted. 0 times theorem prover too weak. 982 trivial. 0 not checked. [2024-11-28 04:37:24,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:37:24,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995348068] [2024-11-28 04:37:24,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995348068] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:37:24,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753166801] [2024-11-28 04:37:24,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:37:24,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:37:24,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:37:24,695 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:37:24,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-28 04:37:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:37:25,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 1462 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-28 04:37:25,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:37:29,509 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-28 04:37:29,517 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-28 04:37:29,823 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:37:29,824 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-28 04:37:29,837 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:37:29,838 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-28 04:37:30,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 0 proven. 413 refuted. 0 times theorem prover too weak. 982 trivial. 0 not checked. [2024-11-28 04:37:30,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:37:30,379 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-28 04:37:30,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:37:30,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:37:30,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:37:30,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:37:30,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:37:30,878 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-28 04:37:33,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 0 proven. 413 refuted. 0 times theorem prover too weak. 982 trivial. 0 not checked. [2024-11-28 04:37:33,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753166801] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:37:33,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:37:33,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 43 [2024-11-28 04:37:33,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633255659] [2024-11-28 04:37:33,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:37:33,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-28 04:37:33,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:37:33,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-28 04:37:33,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1702, Unknown=0, NotChecked=0, Total=1892 [2024-11-28 04:37:33,246 INFO L87 Difference]: Start difference. First operand 170 states and 186 transitions. Second operand has 44 states, 40 states have (on average 4.65) internal successors, (186), 41 states have internal predecessors, (186), 6 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-28 04:37:37,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:37:37,475 INFO L93 Difference]: Finished difference Result 248 states and 270 transitions. [2024-11-28 04:37:37,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 04:37:37,476 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 4.65) internal successors, (186), 41 states have internal predecessors, (186), 6 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) Word has length 152 [2024-11-28 04:37:37,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:37:37,477 INFO L225 Difference]: With dead ends: 248 [2024-11-28 04:37:37,477 INFO L226 Difference]: Without dead ends: 248 [2024-11-28 04:37:37,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=384, Invalid=3276, Unknown=0, NotChecked=0, Total=3660 [2024-11-28 04:37:37,479 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 890 mSDsluCounter, 1879 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 2000 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:37:37,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 2000 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-28 04:37:37,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-28 04:37:37,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 212. [2024-11-28 04:37:37,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 166 states have (on average 1.5120481927710843) internal successors, (251), 203 states have internal predecessors, (251), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:37:37,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 263 transitions. [2024-11-28 04:37:37,488 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 263 transitions. Word has length 152 [2024-11-28 04:37:37,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:37:37,488 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 263 transitions. [2024-11-28 04:37:37,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 4.65) internal successors, (186), 41 states have internal predecessors, (186), 6 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-28 04:37:37,489 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 263 transitions. [2024-11-28 04:37:37,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-28 04:37:37,490 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:37:37,490 INFO L218 NwaCegarLoop]: trace histogram [45, 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-28 04:37:37,506 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-28 04:37:37,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:37:37,691 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 04:37:37,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:37:37,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1130369883, now seen corresponding path program 1 times [2024-11-28 04:37:37,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:37:37,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870214488] [2024-11-28 04:37:37,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:37:37,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:37:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:37:41,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 0 proven. 413 refuted. 0 times theorem prover too weak. 982 trivial. 0 not checked. [2024-11-28 04:37:41,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:37:41,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870214488] [2024-11-28 04:37:41,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870214488] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:37:41,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255925467] [2024-11-28 04:37:41,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:37:41,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:37:41,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:37:41,713 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:37:41,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-28 04:37:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:37:42,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 1478 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-28 04:37:42,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:37:45,727 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-28 04:37:46,059 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-28 04:37:46,141 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-28 04:37:46,149 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-28 04:37:46,362 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:37:46,363 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-28 04:37:46,372 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:37:46,373 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-28 04:37:46,540 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-28 04:37:46,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2024-11-28 04:37:46,550 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:37:46,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255925467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:37:46,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:37:46,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [16] total 26 [2024-11-28 04:37:46,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700179158] [2024-11-28 04:37:46,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:37:46,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 04:37:46,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:37:46,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 04:37:46,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2024-11-28 04:37:46,552 INFO L87 Difference]: Start difference. First operand 212 states and 263 transitions. Second operand has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-28 04:37:48,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:37:48,698 INFO L93 Difference]: Finished difference Result 266 states and 328 transitions. [2024-11-28 04:37:48,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 04:37:48,699 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 154 [2024-11-28 04:37:48,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:37:48,700 INFO L225 Difference]: With dead ends: 266 [2024-11-28 04:37:48,700 INFO L226 Difference]: Without dead ends: 266 [2024-11-28 04:37:48,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=125, Invalid=1065, Unknown=0, NotChecked=0, Total=1190 [2024-11-28 04:37:48,702 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 215 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:37:48,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 755 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-28 04:37:48,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-28 04:37:48,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 212. [2024-11-28 04:37:48,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 167 states have (on average 1.5029940119760479) internal successors, (251), 203 states have internal predecessors, (251), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:37:48,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 263 transitions. [2024-11-28 04:37:48,713 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 263 transitions. Word has length 154 [2024-11-28 04:37:48,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:37:48,714 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 263 transitions. [2024-11-28 04:37:48,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-28 04:37:48,714 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 263 transitions. [2024-11-28 04:37:48,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-28 04:37:48,716 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:37:48,716 INFO L218 NwaCegarLoop]: trace histogram [45, 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-28 04:37:48,736 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-28 04:37:48,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:37:48,917 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 04:37:48,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:37:48,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1130369882, now seen corresponding path program 1 times [2024-11-28 04:37:48,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:37:48,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321736111] [2024-11-28 04:37:48,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:37:48,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:37:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:37:53,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2024-11-28 04:37:53,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:37:53,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321736111] [2024-11-28 04:37:53,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321736111] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:37:53,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65463246] [2024-11-28 04:37:53,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:37:53,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:37:53,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:37:53,843 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:37:53,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-28 04:37:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:37:55,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 1478 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-28 04:37:55,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:37:58,883 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-28 04:37:58,893 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-28 04:37:59,327 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-28 04:37:59,334 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-28 04:37:59,435 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-28 04:37:59,446 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-28 04:37:59,766 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:37:59,767 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-28 04:37:59,774 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:37:59,775 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-28 04:38:00,014 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-28 04:38:00,020 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-28 04:38:00,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 88 proven. 325 refuted. 0 times theorem prover too weak. 982 trivial. 0 not checked. [2024-11-28 04:38:00,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:38:00,890 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-28 04:38:00,895 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-28 04:38:00,974 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-28 04:38:00,987 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-28 04:38:21,472 INFO L349 Elim1Store]: treesize reduction 11, result has 89.5 percent of original size [2024-11-28 04:38:21,472 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 371 treesize of output 434 [2024-11-28 04:38:27,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:38:27,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:38:27,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:38:27,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:38:27,546 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-28 04:38:38,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 88 proven. 325 refuted. 0 times theorem prover too weak. 982 trivial. 0 not checked. [2024-11-28 04:38:38,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65463246] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:38:38,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:38:38,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 19] total 53 [2024-11-28 04:38:38,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029226589] [2024-11-28 04:38:38,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:38:38,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-28 04:38:38,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:38:38,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-28 04:38:38,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=2629, Unknown=5, NotChecked=0, Total=2862 [2024-11-28 04:38:38,670 INFO L87 Difference]: Start difference. First operand 212 states and 263 transitions. Second operand has 54 states, 49 states have (on average 3.9183673469387754) internal successors, (192), 50 states have internal predecessors, (192), 9 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-28 04:38:47,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:38:47,611 INFO L93 Difference]: Finished difference Result 304 states and 330 transitions. [2024-11-28 04:38:47,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-28 04:38:47,613 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 49 states have (on average 3.9183673469387754) internal successors, (192), 50 states have internal predecessors, (192), 9 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) Word has length 154 [2024-11-28 04:38:47,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:38:47,614 INFO L225 Difference]: With dead ends: 304 [2024-11-28 04:38:47,614 INFO L226 Difference]: Without dead ends: 304 [2024-11-28 04:38:47,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 35.9s TimeCoverageRelationStatistics Valid=528, Invalid=5473, Unknown=5, NotChecked=0, Total=6006 [2024-11-28 04:38:47,619 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 1039 mSDsluCounter, 2853 mSDsCounter, 0 mSdLazyCounter, 2079 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 2968 SdHoareTripleChecker+Invalid, 2087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:38:47,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 2968 Invalid, 2087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2079 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-28 04:38:47,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-28 04:38:47,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 245. [2024-11-28 04:38:47,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 200 states have (on average 1.555) internal successors, (311), 236 states have internal predecessors, (311), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:38:47,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 323 transitions. [2024-11-28 04:38:47,627 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 323 transitions. Word has length 154 [2024-11-28 04:38:47,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:38:47,627 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 323 transitions. [2024-11-28 04:38:47,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 49 states have (on average 3.9183673469387754) internal successors, (192), 50 states have internal predecessors, (192), 9 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-28 04:38:47,628 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 323 transitions. [2024-11-28 04:38:47,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-28 04:38:47,628 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:38:47,629 INFO L218 NwaCegarLoop]: trace histogram [45, 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] [2024-11-28 04:38:47,645 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-28 04:38:47,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:38:47,829 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 04:38:47,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:38:47,830 INFO L85 PathProgramCache]: Analyzing trace with hash 341273129, now seen corresponding path program 1 times [2024-11-28 04:38:47,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:38:47,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314818976] [2024-11-28 04:38:47,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:38:47,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:38:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:38:54,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 1 proven. 742 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2024-11-28 04:38:54,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:38:54,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314818976] [2024-11-28 04:38:54,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314818976] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:38:54,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661822895] [2024-11-28 04:38:54,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:38:54,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:38:54,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:38:54,794 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:38:54,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44283328-58c1-4df2-9d17-b7ee9c6f1476/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-28 04:38:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:38:55,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 1494 conjuncts, 126 conjuncts are in the unsatisfiable core [2024-11-28 04:38:55,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:38:59,054 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:38:59,055 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