./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_append_equal.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_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/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_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/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_087bdf43-13b9-43fa-b573-2f9f2497e4c0/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 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 04:53:17,078 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:53:17,139 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 04:53:17,145 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:53:17,145 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:53:17,180 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:53:17,180 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:53:17,181 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:53:17,181 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 04:53:17,181 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 04:53:17,181 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:53:17,181 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:53:17,182 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:53:17,182 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:53:17,182 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:53:17,182 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:53:17,183 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 04:53:17,183 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 04:53:17,183 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 04:53:17,183 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:53:17,185 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 04:53:17,185 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 04:53:17,185 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 04:53:17,186 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:53:17,186 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 04:53:17,186 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 04:53:17,186 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 04:53:17,186 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:53:17,186 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:53:17,186 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:53:17,186 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:53:17,186 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:53:17,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:53:17,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:53:17,187 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:53:17,187 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:53:17,187 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:53:17,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:53:17,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:53:17,187 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:53:17,188 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:53:17,188 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 04:53:17,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 04:53:17,188 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:53:17,188 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:53:17,188 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:53:17,190 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:53:17,190 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_087bdf43-13b9-43fa-b573-2f9f2497e4c0/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 -> 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda [2024-11-28 04:53:17,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:53:17,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:53:17,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:53:17,578 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:53:17,579 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:53:17,582 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-simple/dll2n_append_equal.i [2024-11-28 04:53:20,864 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/data/41843cc75/ceeca92819c9402ca48380f3d0217d97/FLAG46c4b209f [2024-11-28 04:53:21,237 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:53:21,240 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2024-11-28 04:53:21,263 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/data/41843cc75/ceeca92819c9402ca48380f3d0217d97/FLAG46c4b209f [2024-11-28 04:53:21,293 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/data/41843cc75/ceeca92819c9402ca48380f3d0217d97 [2024-11-28 04:53:21,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:53:21,299 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:53:21,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:53:21,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:53:21,312 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:53:21,317 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:53:21" (1/1) ... [2024-11-28 04:53:21,318 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@401cd786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:53:21, skipping insertion in model container [2024-11-28 04:53:21,319 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:53:21" (1/1) ... [2024-11-28 04:53:21,367 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:53:21,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:53:21,837 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 04:53:21,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:53:21,919 INFO L204 MainTranslator]: Completed translation [2024-11-28 04:53:21,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:53:21 WrapperNode [2024-11-28 04:53:21,920 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:53:21,921 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 04:53:21,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 04:53:21,922 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 04:53:21,929 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:53:21" (1/1) ... [2024-11-28 04:53:21,946 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:53:21" (1/1) ... [2024-11-28 04:53:21,968 INFO L138 Inliner]: procedures = 127, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 125 [2024-11-28 04:53:21,969 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 04:53:21,969 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 04:53:21,969 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 04:53:21,970 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 04:53:21,983 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:53:21" (1/1) ... [2024-11-28 04:53:21,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:53:21" (1/1) ... [2024-11-28 04:53:21,989 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:53:21" (1/1) ... [2024-11-28 04:53:22,008 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 6, 13]. 62 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 9 writes are split as follows [0, 1, 8]. [2024-11-28 04:53:22,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:53:21" (1/1) ... [2024-11-28 04:53:22,008 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:53:21" (1/1) ... [2024-11-28 04:53:22,019 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:53:21" (1/1) ... [2024-11-28 04:53:22,020 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:53:21" (1/1) ... [2024-11-28 04:53:22,024 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:53:21" (1/1) ... [2024-11-28 04:53:22,027 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:53:21" (1/1) ... [2024-11-28 04:53:22,028 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:53:21" (1/1) ... [2024-11-28 04:53:22,031 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 04:53:22,032 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 04:53:22,032 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 04:53:22,033 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 04:53:22,034 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:53:21" (1/1) ... [2024-11-28 04:53:22,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:53:22,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:53:22,076 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/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:53:22,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/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:53:22,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 04:53:22,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 04:53:22,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-28 04:53:22,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 04:53:22,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 04:53:22,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-28 04:53:22,125 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-28 04:53:22,126 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-28 04:53:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 04:53:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 04:53:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 04:53:22,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 04:53:22,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 04:53:22,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 04:53:22,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 04:53:22,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 04:53:22,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 04:53:22,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 04:53:22,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-28 04:53:22,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-28 04:53:22,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-28 04:53:22,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 04:53:22,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 04:53:22,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 04:53:22,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 04:53:22,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 04:53:22,338 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 04:53:22,340 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 04:53:22,892 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2024-11-28 04:53:22,892 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 04:53:22,915 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 04:53:22,915 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-28 04:53:22,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:53:22 BoogieIcfgContainer [2024-11-28 04:53:22,915 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 04:53:22,922 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 04:53:22,922 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 04:53:22,932 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 04:53:22,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:53:21" (1/3) ... [2024-11-28 04:53:22,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa67bf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:53:22, skipping insertion in model container [2024-11-28 04:53:22,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:53:21" (2/3) ... [2024-11-28 04:53:22,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa67bf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:53:22, skipping insertion in model container [2024-11-28 04:53:22,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:53:22" (3/3) ... [2024-11-28 04:53:22,938 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2024-11-28 04:53:22,958 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 04:53:22,961 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_append_equal.i that has 2 procedures, 101 locations, 1 initial locations, 4 loop locations, and 41 error locations. [2024-11-28 04:53:23,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 04:53:23,045 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;@6ab859b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 04:53:23,045 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2024-11-28 04:53:23,051 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 97 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:53:23,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-28 04:53:23,061 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:53:23,061 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:53:23,062 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:53:23,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:53:23,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1812855124, now seen corresponding path program 1 times [2024-11-28 04:53:23,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:53:23,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130456801] [2024-11-28 04:53:23,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:53:23,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:53:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:53:23,442 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:53:23,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:53:23,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130456801] [2024-11-28 04:53:23,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130456801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:53:23,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:53:23,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:53:23,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328509745] [2024-11-28 04:53:23,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:53:23,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:53:23,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:53:23,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:53:23,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:53:23,496 INFO L87 Difference]: Start difference. First operand has 101 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 97 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.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:53:23,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:53:23,691 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2024-11-28 04:53:23,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:53:23,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.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:53:23,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:53:23,702 INFO L225 Difference]: With dead ends: 97 [2024-11-28 04:53:23,702 INFO L226 Difference]: Without dead ends: 94 [2024-11-28 04:53:23,704 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:53:23,708 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 3 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:53:23,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 154 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:53:23,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-28 04:53:23,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-28 04:53:23,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 53 states have (on average 1.830188679245283) internal successors, (97), 90 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:53:23,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2024-11-28 04:53:23,780 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 7 [2024-11-28 04:53:23,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:53:23,781 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2024-11-28 04:53:23,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.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:53:23,781 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2024-11-28 04:53:23,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-28 04:53:23,781 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:53:23,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:53:23,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 04:53:23,782 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:53:23,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:53:23,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1812855125, now seen corresponding path program 1 times [2024-11-28 04:53:23,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:53:23,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027663281] [2024-11-28 04:53:23,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:53:23,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:53:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:53:23,978 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:53:23,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:53:23,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027663281] [2024-11-28 04:53:23,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027663281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:53:23,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:53:23,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:53:23,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090445356] [2024-11-28 04:53:23,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:53:23,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:53:23,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:53:23,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:53:23,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:53:23,983 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 3 states, 2 states have (on average 3.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:53:24,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:53:24,115 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2024-11-28 04:53:24,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:53:24,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.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:53:24,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:53:24,117 INFO L225 Difference]: With dead ends: 91 [2024-11-28 04:53:24,117 INFO L226 Difference]: Without dead ends: 91 [2024-11-28 04:53:24,118 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:53:24,119 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 3 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:53:24,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 153 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:53:24,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-28 04:53:24,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-28 04:53:24,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 53 states have (on average 1.7735849056603774) internal successors, (94), 87 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:53:24,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2024-11-28 04:53:24,128 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 7 [2024-11-28 04:53:24,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:53:24,128 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2024-11-28 04:53:24,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.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:53:24,128 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2024-11-28 04:53:24,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-28 04:53:24,129 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:53:24,129 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:53:24,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 04:53:24,130 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:53:24,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:53:24,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1139177187, now seen corresponding path program 1 times [2024-11-28 04:53:24,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:53:24,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140376273] [2024-11-28 04:53:24,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:53:24,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:53:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:53:24,654 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:53:24,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:53:24,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140376273] [2024-11-28 04:53:24,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140376273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:53:24,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:53:24,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:53:24,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842862902] [2024-11-28 04:53:24,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:53:24,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:53:24,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:53:24,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:53:24,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:53:24,658 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:53:24,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:53:24,970 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2024-11-28 04:53:24,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:53:24,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-28 04:53:24,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:53:24,972 INFO L225 Difference]: With dead ends: 89 [2024-11-28 04:53:24,972 INFO L226 Difference]: Without dead ends: 89 [2024-11-28 04:53:24,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:53:24,977 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 7 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:53:24,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 293 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 04:53:24,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-28 04:53:24,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-28 04:53:24,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 53 states have (on average 1.7358490566037736) internal successors, (92), 85 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:53:24,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2024-11-28 04:53:24,992 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 14 [2024-11-28 04:53:24,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:53:24,994 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2024-11-28 04:53:24,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:53:24,994 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2024-11-28 04:53:24,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-28 04:53:24,995 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:53:24,996 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:53:24,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 04:53:24,996 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:53:24,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:53:24,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1139177188, now seen corresponding path program 1 times [2024-11-28 04:53:24,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:53:24,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42748520] [2024-11-28 04:53:24,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:53:24,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:53:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:53:25,197 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:53:25,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:53:25,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42748520] [2024-11-28 04:53:25,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42748520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:53:25,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:53:25,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:53:25,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366388064] [2024-11-28 04:53:25,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:53:25,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:53:25,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:53:25,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:53:25,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:53:25,199 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:53:25,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:53:25,457 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2024-11-28 04:53:25,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:53:25,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-28 04:53:25,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:53:25,459 INFO L225 Difference]: With dead ends: 87 [2024-11-28 04:53:25,459 INFO L226 Difference]: Without dead ends: 87 [2024-11-28 04:53:25,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:53:25,460 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 8 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:53:25,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 277 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:53:25,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-28 04:53:25,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-28 04:53:25,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.6981132075471699) internal successors, (90), 83 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:53:25,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2024-11-28 04:53:25,478 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 14 [2024-11-28 04:53:25,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:53:25,478 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2024-11-28 04:53:25,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:53:25,478 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2024-11-28 04:53:25,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-28 04:53:25,479 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:53:25,479 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:53:25,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 04:53:25,479 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:53:25,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:53:25,480 INFO L85 PathProgramCache]: Analyzing trace with hash 346840124, now seen corresponding path program 1 times [2024-11-28 04:53:25,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:53:25,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145518213] [2024-11-28 04:53:25,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:53:25,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:53:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:53:25,612 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:53:25,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:53:25,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145518213] [2024-11-28 04:53:25,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145518213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:53:25,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:53:25,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:53:25,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020878988] [2024-11-28 04:53:25,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:53:25,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:53:25,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:53:25,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:53:25,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:53:25,615 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:53:25,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:53:25,636 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2024-11-28 04:53:25,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:53:25,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-28 04:53:25,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:53:25,639 INFO L225 Difference]: With dead ends: 97 [2024-11-28 04:53:25,639 INFO L226 Difference]: Without dead ends: 97 [2024-11-28 04:53:25,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:53:25,640 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 9 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:53:25,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 181 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:53:25,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-28 04:53:25,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2024-11-28 04:53:25,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 54 states have (on average 1.6851851851851851) internal successors, (91), 84 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:53:25,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2024-11-28 04:53:25,649 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 16 [2024-11-28 04:53:25,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:53:25,649 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2024-11-28 04:53:25,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:53:25,650 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2024-11-28 04:53:25,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-28 04:53:25,650 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:53:25,650 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:53:25,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 04:53:25,651 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:53:25,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:53:25,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1603952536, now seen corresponding path program 1 times [2024-11-28 04:53:25,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:53:25,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994436258] [2024-11-28 04:53:25,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:53:25,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:53:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:53:25,760 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:53:25,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:53:25,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994436258] [2024-11-28 04:53:25,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994436258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:53:25,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:53:25,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:53:25,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746434031] [2024-11-28 04:53:25,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:53:25,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:53:25,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:53:25,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:53:25,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:53:25,762 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:53:25,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:53:25,797 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2024-11-28 04:53:25,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:53:25,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-28 04:53:25,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:53:25,798 INFO L225 Difference]: With dead ends: 93 [2024-11-28 04:53:25,798 INFO L226 Difference]: Without dead ends: 93 [2024-11-28 04:53:25,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:53:25,799 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:53:25,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:53:25,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-28 04:53:25,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-28 04:53:25,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 58 states have (on average 1.6379310344827587) internal successors, (95), 88 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:53:25,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2024-11-28 04:53:25,813 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 17 [2024-11-28 04:53:25,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:53:25,813 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2024-11-28 04:53:25,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:53:25,813 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2024-11-28 04:53:25,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-28 04:53:25,814 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:53:25,818 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:53:25,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 04:53:25,819 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:53:25,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:53:25,819 INFO L85 PathProgramCache]: Analyzing trace with hash 171788273, now seen corresponding path program 1 times [2024-11-28 04:53:25,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:53:25,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315977570] [2024-11-28 04:53:25,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:53:25,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:53:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:53:26,014 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 04:53:26,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:53:26,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315977570] [2024-11-28 04:53:26,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315977570] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:53:26,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922280384] [2024-11-28 04:53:26,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:53:26,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:53:26,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:53:26,018 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:53:26,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 04:53:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:53:26,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 04:53:26,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:53:26,295 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:53:26,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:53:26,379 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 04:53:26,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922280384] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:53:26,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:53:26,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-28 04:53:26,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818192211] [2024-11-28 04:53:26,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:53:26,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:53:26,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:53:26,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:53:26,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:53:26,382 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 04:53:26,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:53:26,406 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2024-11-28 04:53:26,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:53:26,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2024-11-28 04:53:26,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:53:26,412 INFO L225 Difference]: With dead ends: 95 [2024-11-28 04:53:26,413 INFO L226 Difference]: Without dead ends: 95 [2024-11-28 04:53:26,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:53:26,414 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 9 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:53:26,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 260 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:53:26,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-28 04:53:26,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-28 04:53:26,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 60 states have (on average 1.6166666666666667) internal successors, (97), 90 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:53:26,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2024-11-28 04:53:26,425 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 31 [2024-11-28 04:53:26,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:53:26,425 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2024-11-28 04:53:26,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 04:53:26,425 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2024-11-28 04:53:26,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-28 04:53:26,426 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:53:26,426 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-28 04:53:26,441 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 04:53:26,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:53:26,631 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:53:26,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:53:26,631 INFO L85 PathProgramCache]: Analyzing trace with hash 472312451, now seen corresponding path program 1 times [2024-11-28 04:53:26,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:53:26,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73178030] [2024-11-28 04:53:26,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:53:26,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:53:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:53:27,157 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:53:27,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:53:27,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73178030] [2024-11-28 04:53:27,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73178030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:53:27,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781302391] [2024-11-28 04:53:27,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:53:27,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:53:27,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:53:27,163 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:53:27,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 04:53:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:53:27,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-28 04:53:27,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:53:27,530 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 04:53:27,531 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:53:27,632 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:53:27,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:53:28,162 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:53:28,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781302391] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:53:28,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:53:28,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 18 [2024-11-28 04:53:28,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804914642] [2024-11-28 04:53:28,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:53:28,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 04:53:28,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:53:28,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 04:53:28,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-11-28 04:53:28,167 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-28 04:53:28,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:53:28,866 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2024-11-28 04:53:28,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 04:53:28,867 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2024-11-28 04:53:28,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:53:28,868 INFO L225 Difference]: With dead ends: 94 [2024-11-28 04:53:28,868 INFO L226 Difference]: Without dead ends: 94 [2024-11-28 04:53:28,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-28 04:53:28,869 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 7 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:53:28,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 672 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 04:53:28,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-28 04:53:28,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-28 04:53:28,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 60 states have (on average 1.6) internal successors, (96), 89 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:53:28,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2024-11-28 04:53:28,876 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 32 [2024-11-28 04:53:28,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:53:28,876 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2024-11-28 04:53:28,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-28 04:53:28,876 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2024-11-28 04:53:28,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-28 04:53:28,877 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:53:28,877 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-28 04:53:28,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-28 04:53:29,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:53:29,078 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:53:29,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:53:29,079 INFO L85 PathProgramCache]: Analyzing trace with hash 472312452, now seen corresponding path program 1 times [2024-11-28 04:53:29,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:53:29,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011742611] [2024-11-28 04:53:29,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:53:29,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:53:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:53:29,659 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:53:29,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:53:29,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011742611] [2024-11-28 04:53:29,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011742611] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:53:29,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563671468] [2024-11-28 04:53:29,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:53:29,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:53:29,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:53:29,664 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:53:29,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 04:53:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:53:29,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-28 04:53:29,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:53:29,864 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:53:30,094 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 04:53:30,095 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:53:30,164 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:53:30,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:53:30,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563671468] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:53:30,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:53:30,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 15 [2024-11-28 04:53:30,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302460163] [2024-11-28 04:53:30,304 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:53:30,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 04:53:30,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:53:30,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 04:53:30,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-11-28 04:53:30,305 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 12 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 04:53:30,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:53:30,845 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2024-11-28 04:53:30,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 04:53:30,846 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 12 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2024-11-28 04:53:30,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:53:30,847 INFO L225 Difference]: With dead ends: 93 [2024-11-28 04:53:30,847 INFO L226 Difference]: Without dead ends: 93 [2024-11-28 04:53:30,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2024-11-28 04:53:30,848 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 5 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:53:30,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 635 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 04:53:30,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-28 04:53:30,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-28 04:53:30,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.5833333333333333) internal successors, (95), 88 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:53:30,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2024-11-28 04:53:30,853 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 32 [2024-11-28 04:53:30,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:53:30,853 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2024-11-28 04:53:30,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 12 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 04:53:30,854 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2024-11-28 04:53:30,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-28 04:53:30,855 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:53:30,855 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:53:30,866 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 04:53:31,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:53:31,060 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:53:31,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:53:31,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1518675044, now seen corresponding path program 2 times [2024-11-28 04:53:31,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:53:31,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795957749] [2024-11-28 04:53:31,060 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:53:31,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:53:31,112 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:53:31,113 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:53:31,274 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 04:53:31,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:53:31,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795957749] [2024-11-28 04:53:31,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795957749] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:53:31,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872323360] [2024-11-28 04:53:31,275 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:53:31,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:53:31,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:53:31,279 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:53:31,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 04:53:31,481 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:53:31,481 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:53:31,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 04:53:31,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:53:31,542 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:53:31,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:53:31,609 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 04:53:31,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872323360] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:53:31,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:53:31,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2024-11-28 04:53:31,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671943073] [2024-11-28 04:53:31,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:53:31,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:53:31,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:53:31,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:53:31,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:53:31,612 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 04:53:31,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:53:31,717 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2024-11-28 04:53:31,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:53:31,718 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2024-11-28 04:53:31,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:53:31,719 INFO L225 Difference]: With dead ends: 93 [2024-11-28 04:53:31,719 INFO L226 Difference]: Without dead ends: 93 [2024-11-28 04:53:31,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-28 04:53:31,720 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 4 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:53:31,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 483 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:53:31,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-28 04:53:31,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-28 04:53:31,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 88 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:53:31,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2024-11-28 04:53:31,725 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 46 [2024-11-28 04:53:31,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:53:31,725 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2024-11-28 04:53:31,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 04:53:31,726 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2024-11-28 04:53:31,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 04:53:31,727 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:53:31,727 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:53:31,738 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 04:53:31,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:53:31,932 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:53:31,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:53:31,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1914778708, now seen corresponding path program 1 times [2024-11-28 04:53:31,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:53:31,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956385969] [2024-11-28 04:53:31,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:53:31,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:53:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:53:32,737 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 04:53:32,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:53:32,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956385969] [2024-11-28 04:53:32,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956385969] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:53:32,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825342892] [2024-11-28 04:53:32,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:53:32,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:53:32,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:53:32,740 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:53:32,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 04:53:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:53:32,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-28 04:53:32,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:53:32,975 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:53:33,016 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 5 treesize of output 3 [2024-11-28 04:53:33,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:53:33,098 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:53:33,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:53:33,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:53:33,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:53:33,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:53:33,397 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 04:53:33,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2024-11-28 04:53:33,672 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-11-28 04:53:33,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:53:33,723 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2024-11-28 04:53:33,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2024-11-28 04:53:33,781 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 14 not checked. [2024-11-28 04:53:33,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:54:22,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825342892] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:54:22,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:54:22,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2024-11-28 04:54:22,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323118741] [2024-11-28 04:54:22,508 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:54:22,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-28 04:54:22,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:54:22,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-28 04:54:22,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=489, Unknown=12, NotChecked=46, Total=650 [2024-11-28 04:54:22,510 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 22 states, 21 states have (on average 3.142857142857143) internal successors, (66), 19 states have internal predecessors, (66), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-28 04:54:23,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:54:23,521 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2024-11-28 04:54:23,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 04:54:23,522 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.142857142857143) internal successors, (66), 19 states have internal predecessors, (66), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 47 [2024-11-28 04:54:23,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:54:23,523 INFO L225 Difference]: With dead ends: 100 [2024-11-28 04:54:23,523 INFO L226 Difference]: Without dead ends: 100 [2024-11-28 04:54:23,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 49.2s TimeCoverageRelationStatistics Valid=153, Invalid=709, Unknown=12, NotChecked=56, Total=930 [2024-11-28 04:54:23,524 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 198 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 04:54:23,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 500 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 615 Invalid, 0 Unknown, 98 Unchecked, 0.8s Time] [2024-11-28 04:54:23,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-28 04:54:23,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 88. [2024-11-28 04:54:23,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 83 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:54:23,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2024-11-28 04:54:23,532 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 47 [2024-11-28 04:54:23,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:54:23,535 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2024-11-28 04:54:23,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.142857142857143) internal successors, (66), 19 states have internal predecessors, (66), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-28 04:54:23,535 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2024-11-28 04:54:23,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 04:54:23,536 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:54:23,536 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:54:23,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 04:54:23,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:54:23,737 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:54:23,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:54:23,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1914778709, now seen corresponding path program 1 times [2024-11-28 04:54:23,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:54:23,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251072028] [2024-11-28 04:54:23,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:54:23,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:54:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:54:24,658 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:54:24,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:54:24,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251072028] [2024-11-28 04:54:24,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251072028] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:54:24,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039681474] [2024-11-28 04:54:24,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:54:24,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:54:24,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:54:24,661 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:54:24,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 04:54:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:54:24,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-28 04:54:24,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:54:24,892 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:54:24,912 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 5 treesize of output 3 [2024-11-28 04:54:24,945 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-28 04:54:25,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:54:25,003 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:54:25,074 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 5 treesize of output 3 [2024-11-28 04:54:25,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:54:25,144 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:54:25,294 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 5 treesize of output 3 [2024-11-28 04:54:25,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:54:25,368 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:54:25,381 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-28 04:54:25,381 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:54:25,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039681474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:54:25,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:54:25,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 15 [2024-11-28 04:54:25,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220391009] [2024-11-28 04:54:25,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:54:25,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:54:25,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:54:25,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:54:25,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=170, Unknown=1, NotChecked=26, Total=240 [2024-11-28 04:54:25,384 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:54:25,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:54:25,581 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2024-11-28 04:54:25,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 04:54:25,582 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2024-11-28 04:54:25,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:54:25,583 INFO L225 Difference]: With dead ends: 85 [2024-11-28 04:54:25,583 INFO L226 Difference]: Without dead ends: 85 [2024-11-28 04:54:25,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=194, Unknown=1, NotChecked=28, Total=272 [2024-11-28 04:54:25,584 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 4 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:54:25,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 238 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 112 Unchecked, 0.2s Time] [2024-11-28 04:54:25,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-28 04:54:25,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-28 04:54:25,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 80 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:54:25,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2024-11-28 04:54:25,589 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 47 [2024-11-28 04:54:25,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:54:25,590 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2024-11-28 04:54:25,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:54:25,590 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2024-11-28 04:54:25,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-28 04:54:25,591 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:54:25,591 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:54:25,603 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 04:54:25,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-28 04:54:25,796 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:54:25,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:54:25,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1527735065, now seen corresponding path program 1 times [2024-11-28 04:54:25,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:54:25,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268383518] [2024-11-28 04:54:25,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:54:25,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:54:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:54:26,419 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 04:54:26,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:54:26,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268383518] [2024-11-28 04:54:26,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268383518] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:54:26,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570123654] [2024-11-28 04:54:26,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:54:26,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:54:26,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:54:26,424 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:54:26,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 04:54:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:54:27,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-28 04:54:27,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:54: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 9 treesize of output 3 [2024-11-28 04:54:27,563 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-28 04:54:27,641 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-28 04:54:27,642 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 23 treesize of output 24 [2024-11-28 04:54:27,678 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 17 treesize of output 9 [2024-11-28 04:54:27,684 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-28 04:54:27,684 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:54:27,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570123654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:54:27,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:54:27,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 20 [2024-11-28 04:54:27,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013696237] [2024-11-28 04:54:27,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:54:27,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 04:54:27,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:54:27,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 04:54:27,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=332, Unknown=1, NotChecked=36, Total=420 [2024-11-28 04:54:27,685 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:54:27,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:54:27,942 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2024-11-28 04:54:27,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 04:54:27,943 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2024-11-28 04:54:27,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:54:27,943 INFO L225 Difference]: With dead ends: 84 [2024-11-28 04:54:27,943 INFO L226 Difference]: Without dead ends: 84 [2024-11-28 04:54:27,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=367, Unknown=1, NotChecked=38, Total=462 [2024-11-28 04:54:27,944 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 10 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:54:27,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 298 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 226 Invalid, 0 Unknown, 154 Unchecked, 0.2s Time] [2024-11-28 04:54:27,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-28 04:54:27,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-28 04:54:27,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 79 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:54:27,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2024-11-28 04:54:27,949 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 51 [2024-11-28 04:54:27,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:54:27,949 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2024-11-28 04:54:27,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:54:27,950 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2024-11-28 04:54:27,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-28 04:54:27,951 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:54:27,951 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:54:27,964 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 04:54:28,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:54:28,156 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:54:28,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:54:28,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1527735066, now seen corresponding path program 1 times [2024-11-28 04:54:28,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:54:28,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805056587] [2024-11-28 04:54:28,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:54:28,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:54:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:54:29,181 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 04:54:29,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:54:29,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805056587] [2024-11-28 04:54:29,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805056587] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:54:29,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113076991] [2024-11-28 04:54:29,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:54:29,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:54:29,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:54:29,188 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:54:29,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 04:54:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:54:29,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-28 04:54:29,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:54:29,668 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:54:30,182 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 9 treesize of output 3 [2024-11-28 04:54:30,187 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 9 treesize of output 3 [2024-11-28 04:54:30,264 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0))) is different from true [2024-11-28 04:54:30,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:54:30,341 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:54:30,353 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 04:54:30,353 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 15 treesize of output 15 [2024-11-28 04:54:30,504 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 17 treesize of output 9 [2024-11-28 04:54:30,612 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 7 not checked. [2024-11-28 04:54:30,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:54:30,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113076991] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:54:30,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:54:30,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2024-11-28 04:54:30,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859645985] [2024-11-28 04:54:30,997 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:54:30,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-28 04:54:30,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:54:30,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-28 04:54:30,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=966, Unknown=1, NotChecked=62, Total=1122 [2024-11-28 04:54:30,999 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 30 states, 27 states have (on average 2.962962962962963) internal successors, (80), 26 states have internal predecessors, (80), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-28 04:54:32,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:54:32,450 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2024-11-28 04:54:32,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 04:54:32,451 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.962962962962963) internal successors, (80), 26 states have internal predecessors, (80), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2024-11-28 04:54:32,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:54:32,452 INFO L225 Difference]: With dead ends: 98 [2024-11-28 04:54:32,452 INFO L226 Difference]: Without dead ends: 98 [2024-11-28 04:54:32,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=168, Invalid=1815, Unknown=1, NotChecked=86, Total=2070 [2024-11-28 04:54:32,454 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 62 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 04:54:32,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 744 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 893 Invalid, 0 Unknown, 93 Unchecked, 0.9s Time] [2024-11-28 04:54:32,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-28 04:54:32,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2024-11-28 04:54:32,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 71 states have (on average 1.352112676056338) internal successors, (96), 89 states have internal predecessors, (96), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:54:32,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2024-11-28 04:54:32,459 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 51 [2024-11-28 04:54:32,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:54:32,459 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-11-28 04:54:32,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.962962962962963) internal successors, (80), 26 states have internal predecessors, (80), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-28 04:54:32,460 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2024-11-28 04:54:32,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-28 04:54:32,461 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:54:32,461 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:54:32,474 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-28 04:54:32,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:54:32,665 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:54:32,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:54:32,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1527582199, now seen corresponding path program 1 times [2024-11-28 04:54:32,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:54:32,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712255283] [2024-11-28 04:54:32,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:54:32,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:54:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:54:33,092 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-28 04:54:33,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:54:33,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712255283] [2024-11-28 04:54:33,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712255283] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:54:33,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465615862] [2024-11-28 04:54:33,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:54:33,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:54:33,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:54:33,095 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:54:33,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 04:54:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:54:33,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-28 04:54:33,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:54:33,364 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:54:33,374 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:54:33,428 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 5 treesize of output 3 [2024-11-28 04:54:33,434 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 5 treesize of output 3 [2024-11-28 04:54:33,558 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:54:33,558 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:54:33,570 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:54:33,709 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 5 treesize of output 3 [2024-11-28 04:54:33,744 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-28 04:54:33,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:54:33,799 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:54:33,911 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 5 treesize of output 3 [2024-11-28 04:54:33,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:54:33,974 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:54:34,037 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 14 not checked. [2024-11-28 04:54:34,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:54:34,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465615862] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:54:34,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:54:34,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2024-11-28 04:54:34,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129225245] [2024-11-28 04:54:34,231 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:54:34,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 04:54:34,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:54:34,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 04:54:34,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=330, Unknown=1, NotChecked=36, Total=420 [2024-11-28 04:54:34,233 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 15 states have internal predecessors, (71), 4 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-28 04:54:34,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:54:34,998 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2024-11-28 04:54:34,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 04:54:34,999 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 15 states have internal predecessors, (71), 4 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2024-11-28 04:54:34,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:54:35,000 INFO L225 Difference]: With dead ends: 92 [2024-11-28 04:54:35,000 INFO L226 Difference]: Without dead ends: 92 [2024-11-28 04:54:35,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=797, Unknown=1, NotChecked=58, Total=992 [2024-11-28 04:54:35,001 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 117 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:54:35,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 547 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 600 Invalid, 0 Unknown, 77 Unchecked, 0.5s Time] [2024-11-28 04:54:35,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-28 04:54:35,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-28 04:54:35,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 86 states have internal predecessors, (92), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:54:35,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2024-11-28 04:54:35,005 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 51 [2024-11-28 04:54:35,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:54:35,006 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2024-11-28 04:54:35,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 15 states have internal predecessors, (71), 4 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-28 04:54:35,006 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2024-11-28 04:54:35,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-28 04:54:35,007 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:54:35,007 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:54:35,019 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-28 04:54:35,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-28 04:54:35,208 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:54:35,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:54:35,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1013081237, now seen corresponding path program 1 times [2024-11-28 04:54:35,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:54:35,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213515994] [2024-11-28 04:54:35,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:54:35,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:54:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:54:35,384 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-28 04:54:35,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:54:35,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213515994] [2024-11-28 04:54:35,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213515994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:54:35,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:54:35,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:54:35,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148695159] [2024-11-28 04:54:35,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:54:35,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:54:35,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:54:35,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:54:35,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:54:35,388 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:54:35,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:54:35,538 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2024-11-28 04:54:35,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:54:35,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2024-11-28 04:54:35,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:54:35,540 INFO L225 Difference]: With dead ends: 91 [2024-11-28 04:54:35,540 INFO L226 Difference]: Without dead ends: 91 [2024-11-28 04:54:35,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:54:35,541 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 8 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:54:35,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 222 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:54:35,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-28 04:54:35,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-28 04:54:35,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 70 states have (on average 1.3) internal successors, (91), 85 states have internal predecessors, (91), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:54:35,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2024-11-28 04:54:35,548 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 54 [2024-11-28 04:54:35,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:54:35,548 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2024-11-28 04:54:35,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:54:35,549 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2024-11-28 04:54:35,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-28 04:54:35,550 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:54:35,550 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:54:35,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 04:54:35,551 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:54:35,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:54:35,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1013081236, now seen corresponding path program 1 times [2024-11-28 04:54:35,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:54:35,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460717933] [2024-11-28 04:54:35,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:54:35,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:54:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:54:35,869 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-28 04:54:35,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:54:35,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460717933] [2024-11-28 04:54:35,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460717933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:54:35,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:54:35,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:54:35,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949331434] [2024-11-28 04:54:35,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:54:35,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:54:35,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:54:35,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:54:35,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:54:35,873 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:54:36,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:54:36,037 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2024-11-28 04:54:36,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:54:36,039 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2024-11-28 04:54:36,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:54:36,040 INFO L225 Difference]: With dead ends: 90 [2024-11-28 04:54:36,040 INFO L226 Difference]: Without dead ends: 90 [2024-11-28 04:54:36,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:54:36,041 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 7 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:54:36,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 230 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:54:36,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-28 04:54:36,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-28 04:54:36,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 84 states have internal predecessors, (90), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:54:36,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2024-11-28 04:54:36,047 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 54 [2024-11-28 04:54:36,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:54:36,048 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2024-11-28 04:54:36,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:54:36,048 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2024-11-28 04:54:36,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 04:54:36,049 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:54:36,049 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:54:36,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 04:54:36,049 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:54:36,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:54:36,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1340813775, now seen corresponding path program 1 times [2024-11-28 04:54:36,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:54:36,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046583803] [2024-11-28 04:54:36,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:54:36,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:54:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:54:38,066 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:54:38,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:54:38,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046583803] [2024-11-28 04:54:38,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046583803] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:54:38,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073519297] [2024-11-28 04:54:38,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:54:38,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:54:38,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:54:38,070 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:54:38,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 04:54:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:54:38,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-28 04:54:38,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:54:39,067 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:54:39,068 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:54:39,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:54:39,328 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:54:39,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-28 04:54:39,611 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 30 treesize of output 14 [2024-11-28 04:54:39,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 04:54:39,938 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2024-11-28 04:54:39,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:54:39,986 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 38 treesize of output 27 [2024-11-28 04:54:40,023 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2024-11-28 04:54:40,023 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 36 treesize of output 52 [2024-11-28 04:54:40,133 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 46 treesize of output 26 [2024-11-28 04:54:40,278 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 25 treesize of output 13 [2024-11-28 04:54:40,464 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-28 04:54:40,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:54:40,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073519297] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:54:40,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:54:40,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 46 [2024-11-28 04:54:40,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471290866] [2024-11-28 04:54:40,853 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:54:40,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-28 04:54:40,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:54:40,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-28 04:54:40,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2289, Unknown=1, NotChecked=96, Total=2550 [2024-11-28 04:54:40,856 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 47 states, 45 states have (on average 2.066666666666667) internal successors, (93), 41 states have internal predecessors, (93), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:54:43,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:54:43,178 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2024-11-28 04:54:43,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-28 04:54:43,179 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 45 states have (on average 2.066666666666667) internal successors, (93), 41 states have internal predecessors, (93), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 55 [2024-11-28 04:54:43,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:54:43,180 INFO L225 Difference]: With dead ends: 102 [2024-11-28 04:54:43,180 INFO L226 Difference]: Without dead ends: 102 [2024-11-28 04:54:43,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1184 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=336, Invalid=4359, Unknown=1, NotChecked=134, Total=4830 [2024-11-28 04:54:43,182 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 86 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 1634 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:54:43,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1098 Invalid, 1765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1634 Invalid, 0 Unknown, 110 Unchecked, 1.4s Time] [2024-11-28 04:54:43,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-28 04:54:43,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2024-11-28 04:54:43,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 86 states have internal predecessors, (93), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:54:43,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2024-11-28 04:54:43,186 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 55 [2024-11-28 04:54:43,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:54:43,186 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2024-11-28 04:54:43,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 45 states have (on average 2.066666666666667) internal successors, (93), 41 states have internal predecessors, (93), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:54:43,187 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2024-11-28 04:54:43,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 04:54:43,187 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:54:43,188 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:54:43,204 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-28 04:54:43,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-28 04:54:43,388 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:54:43,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:54:43,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1340813774, now seen corresponding path program 1 times [2024-11-28 04:54:43,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:54:43,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335419768] [2024-11-28 04:54:43,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:54:43,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:54:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:54:45,943 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:54:45,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:54:45,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335419768] [2024-11-28 04:54:45,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335419768] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:54:45,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196135019] [2024-11-28 04:54:45,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:54:45,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:54:45,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:54:45,946 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:54:45,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 04:54:46,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:54:46,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 132 conjuncts are in the unsatisfiable core [2024-11-28 04:54:46,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:54:46,604 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:54:46,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:54:46,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-28 04:54:46,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-28 04:54:47,042 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:54:47,042 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:54:47,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-28 04:54:47,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-28 04:54:47,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:54:47,453 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:54:47,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2024-11-28 04:54:47,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2024-11-28 04:54:47,919 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 43 treesize of output 19 [2024-11-28 04:54:47,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2024-11-28 04:54:47,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 04:54:47,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 04:54:48,300 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2024-11-28 04:54:48,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:54:48,350 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 51 treesize of output 34 [2024-11-28 04:54:48,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:54:48,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-11-28 04:54:48,385 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-28 04:54:48,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-28 04:54:48,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2024-11-28 04:54:48,621 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 59 treesize of output 35 [2024-11-28 04:54:48,825 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 25 treesize of output 13 [2024-11-28 04:54:48,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 04:54:48,839 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-28 04:54:48,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:54:49,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196135019] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:54:49,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:54:49,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 50 [2024-11-28 04:54:49,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555062528] [2024-11-28 04:54:49,475 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:54:49,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-28 04:54:49,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:54:49,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-28 04:54:49,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2895, Unknown=1, NotChecked=108, Total=3192 [2024-11-28 04:54:49,478 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand has 51 states, 48 states have (on average 1.8541666666666667) internal successors, (89), 44 states have internal predecessors, (89), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:54:52,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:54:52,792 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2024-11-28 04:54:52,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-28 04:54:52,793 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 1.8541666666666667) internal successors, (89), 44 states have internal predecessors, (89), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 55 [2024-11-28 04:54:52,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:54:52,796 INFO L225 Difference]: With dead ends: 97 [2024-11-28 04:54:52,796 INFO L226 Difference]: Without dead ends: 97 [2024-11-28 04:54:52,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=320, Invalid=4795, Unknown=1, NotChecked=140, Total=5256 [2024-11-28 04:54:52,798 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 56 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 1928 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1378 SdHoareTripleChecker+Invalid, 2037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:54:52,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1378 Invalid, 2037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1928 Invalid, 0 Unknown, 102 Unchecked, 2.0s Time] [2024-11-28 04:54:52,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-28 04:54:52,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2024-11-28 04:54:52,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.2837837837837838) internal successors, (95), 88 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:54:52,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2024-11-28 04:54:52,802 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 55 [2024-11-28 04:54:52,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:54:52,803 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2024-11-28 04:54:52,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 1.8541666666666667) internal successors, (89), 44 states have internal predecessors, (89), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:54:52,803 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2024-11-28 04:54:52,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-28 04:54:52,804 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:54:52,804 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:54:52,817 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-28 04:54:53,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:54:53,005 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:54:53,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:54:53,005 INFO L85 PathProgramCache]: Analyzing trace with hash -541135543, now seen corresponding path program 2 times [2024-11-28 04:54:53,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:54:53,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643032086] [2024-11-28 04:54:53,006 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:54:53,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:54:53,073 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:54:53,073 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:54:56,867 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 11 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 04:54:56,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:54:56,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643032086] [2024-11-28 04:54:56,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643032086] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:54:56,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517091905] [2024-11-28 04:54:56,867 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:54:56,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:54:56,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:54:56,869 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:54:56,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 04:54:57,139 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:54:57,139 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:54:57,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 126 conjuncts are in the unsatisfiable core [2024-11-28 04:54:57,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:54:57,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:54:57,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 11 treesize of output 7 [2024-11-28 04:54:57,979 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:54:57,980 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:54:57,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 04:54:57,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 04:54:58,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 04:54:58,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 04:54:58,269 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 21 treesize of output 20 [2024-11-28 04:54:58,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-28 04:54:58,485 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2024-11-28 04:54:58,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 65 [2024-11-28 04:54:58,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 29 [2024-11-28 04:54:58,974 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-28 04:54:58,974 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 27 [2024-11-28 04:54:58,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-28 04:54:58,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 04:54:59,039 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-28 04:54:59,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:54:59,084 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-28 04:54:59,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 75 [2024-11-28 04:54:59,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:54:59,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:54:59,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2024-11-28 04:54:59,119 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-28 04:54:59,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-11-28 04:54:59,272 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 89 treesize of output 65 [2024-11-28 04:54:59,283 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 69 treesize of output 49 [2024-11-28 04:54:59,943 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 6 not checked. [2024-11-28 04:54:59,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:55:00,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517091905] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:55:00,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:55:00,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 57 [2024-11-28 04:55:00,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321521438] [2024-11-28 04:55:00,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:55:00,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-28 04:55:00,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:55:00,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-28 04:55:00,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=3597, Unknown=1, NotChecked=120, Total=3906 [2024-11-28 04:55:00,745 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 57 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 52 states have internal predecessors, (96), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:55:04,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:55:04,149 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2024-11-28 04:55:04,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-28 04:55:04,150 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 52 states have internal predecessors, (96), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 59 [2024-11-28 04:55:04,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:55:04,151 INFO L225 Difference]: With dead ends: 119 [2024-11-28 04:55:04,151 INFO L226 Difference]: Without dead ends: 119 [2024-11-28 04:55:04,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1428 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=315, Invalid=6330, Unknown=1, NotChecked=160, Total=6806 [2024-11-28 04:55:04,154 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 11 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 1827 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 1947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-28 04:55:04,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1682 Invalid, 1947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1827 Invalid, 0 Unknown, 111 Unchecked, 1.8s Time] [2024-11-28 04:55:04,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-28 04:55:04,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2024-11-28 04:55:04,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 94 states have (on average 1.2446808510638299) internal successors, (117), 108 states have internal predecessors, (117), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 04:55:04,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2024-11-28 04:55:04,159 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 59 [2024-11-28 04:55:04,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:55:04,159 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2024-11-28 04:55:04,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 52 states have internal predecessors, (96), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:55:04,160 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2024-11-28 04:55:04,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-28 04:55:04,160 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:55:04,161 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 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:55:04,171 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-28 04:55:04,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:55:04,361 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:55:04,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:55:04,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1330031275, now seen corresponding path program 1 times [2024-11-28 04:55:04,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:55:04,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432845239] [2024-11-28 04:55:04,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:55:04,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:55:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:55:04,962 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-28 04:55:04,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:55:04,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432845239] [2024-11-28 04:55:04,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432845239] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:55:04,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004959253] [2024-11-28 04:55:04,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:55:04,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:55:04,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:55:04,965 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:55:04,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 04:55:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:55:05,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-28 04:55:05,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:55:05,279 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:55:05,668 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 9 treesize of output 3 [2024-11-28 04:55:05,673 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 9 treesize of output 3 [2024-11-28 04:55:05,939 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 04:55:05,939 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 21 [2024-11-28 04:55:05,964 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 04:55:05,964 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 15 treesize of output 15 [2024-11-28 04:55:06,217 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 17 treesize of output 9 [2024-11-28 04:55:06,323 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 04:55:06,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:55:06,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004959253] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:55:06,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:55:06,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 29 [2024-11-28 04:55:06,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562168720] [2024-11-28 04:55:06,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:55:06,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-28 04:55:06,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:55:06,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-28 04:55:06,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1034, Unknown=0, NotChecked=0, Total=1122 [2024-11-28 04:55:06,729 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand has 30 states, 28 states have (on average 3.0) internal successors, (84), 26 states have internal predecessors, (84), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-28 04:55:08,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:55:08,169 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2024-11-28 04:55:08,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-28 04:55:08,170 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 3.0) internal successors, (84), 26 states have internal predecessors, (84), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 60 [2024-11-28 04:55:08,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:55:08,171 INFO L225 Difference]: With dead ends: 126 [2024-11-28 04:55:08,171 INFO L226 Difference]: Without dead ends: 126 [2024-11-28 04:55:08,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=191, Invalid=2161, Unknown=0, NotChecked=0, Total=2352 [2024-11-28 04:55:08,173 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 59 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 1233 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:55:08,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 911 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1233 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 04:55:08,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-28 04:55:08,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2024-11-28 04:55:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 98 states have (on average 1.2755102040816326) internal successors, (125), 112 states have internal predecessors, (125), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 04:55:08,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 135 transitions. [2024-11-28 04:55:08,179 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 135 transitions. Word has length 60 [2024-11-28 04:55:08,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:55:08,179 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 135 transitions. [2024-11-28 04:55:08,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 3.0) internal successors, (84), 26 states have internal predecessors, (84), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-28 04:55:08,180 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 135 transitions. [2024-11-28 04:55:08,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-28 04:55:08,180 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:55:08,181 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 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:55:08,193 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-28 04:55:08,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-28 04:55:08,385 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:55:08,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:55:08,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1330031276, now seen corresponding path program 1 times [2024-11-28 04:55:08,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:55:08,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506659508] [2024-11-28 04:55:08,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:55:08,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:55:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:55:08,642 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-28 04:55:08,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:55:08,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506659508] [2024-11-28 04:55:08,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506659508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:55:08,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:55:08,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 04:55:08,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624260399] [2024-11-28 04:55:08,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:55:08,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 04:55:08,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:55:08,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 04:55:08,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 04:55:08,645 INFO L87 Difference]: Start difference. First operand 120 states and 135 transitions. Second operand has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:55:08,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:55:08,841 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2024-11-28 04:55:08,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:55:08,845 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 60 [2024-11-28 04:55:08,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:55:08,846 INFO L225 Difference]: With dead ends: 125 [2024-11-28 04:55:08,846 INFO L226 Difference]: Without dead ends: 125 [2024-11-28 04:55:08,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:55:08,847 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 41 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:55:08,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 331 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:55:08,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-28 04:55:08,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 119. [2024-11-28 04:55:08,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 98 states have (on average 1.2448979591836735) internal successors, (122), 111 states have internal predecessors, (122), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 04:55:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2024-11-28 04:55:08,856 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 60 [2024-11-28 04:55:08,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:55:08,859 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2024-11-28 04:55:08,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:55:08,860 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2024-11-28 04:55:08,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-28 04:55:08,860 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:55:08,860 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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:55:08,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 04:55:08,860 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:55:08,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:55:08,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1885972851, now seen corresponding path program 1 times [2024-11-28 04:55:08,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:55:08,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706866324] [2024-11-28 04:55:08,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:55:08,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:55:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:55:09,316 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-28 04:55:09,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:55:09,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706866324] [2024-11-28 04:55:09,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706866324] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:55:09,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569628322] [2024-11-28 04:55:09,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:55:09,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:55:09,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:55:09,320 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:55:09,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 04:55:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:55:09,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-28 04:55:09,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:55:09,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 16 treesize of output 8 [2024-11-28 04:55:09,898 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 04:55:09,899 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:55:09,973 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-28 04:55:09,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569628322] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:55:09,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:55:09,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 21 [2024-11-28 04:55:09,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463854781] [2024-11-28 04:55:09,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:55:09,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 04:55:09,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:55:09,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 04:55:09,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2024-11-28 04:55:09,975 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 21 states, 21 states have (on average 3.619047619047619) internal successors, (76), 19 states have internal predecessors, (76), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-28 04:55:14,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 04:55:18,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 04:55:22,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 04:55:26,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 04:55:30,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 04:55:34,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 04:55:38,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 04:55:42,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 04:55:42,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:55:42,656 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2024-11-28 04:55:42,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 04:55:42,656 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.619047619047619) internal successors, (76), 19 states have internal predecessors, (76), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 63 [2024-11-28 04:55:42,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:55:42,657 INFO L225 Difference]: With dead ends: 123 [2024-11-28 04:55:42,658 INFO L226 Difference]: Without dead ends: 123 [2024-11-28 04:55:42,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=1134, Unknown=0, NotChecked=0, Total=1260 [2024-11-28 04:55:42,659 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 103 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 4 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:55:42,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 960 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 537 Invalid, 8 Unknown, 0 Unchecked, 32.4s Time] [2024-11-28 04:55:42,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-28 04:55:42,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2024-11-28 04:55:42,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 98 states have (on average 1.2346938775510203) internal successors, (121), 111 states have internal predecessors, (121), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 04:55:42,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2024-11-28 04:55:42,671 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 63 [2024-11-28 04:55:42,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:55:42,671 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2024-11-28 04:55:42,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.619047619047619) internal successors, (76), 19 states have internal predecessors, (76), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-28 04:55:42,671 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2024-11-28 04:55:42,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-28 04:55:42,672 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:55:42,672 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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:55:42,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-28 04:55:42,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-28 04:55:42,873 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:55:42,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:55:42,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1590139903, now seen corresponding path program 1 times [2024-11-28 04:55:42,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:55:42,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384543487] [2024-11-28 04:55:42,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:55:42,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:55:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:55:45,006 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:55:45,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:55:45,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384543487] [2024-11-28 04:55:45,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384543487] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:55:45,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809058116] [2024-11-28 04:55:45,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:55:45,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:55:45,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:55:45,008 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:55:45,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-28 04:55:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:55:45,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 109 conjuncts are in the unsatisfiable core [2024-11-28 04:55:45,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:55:45,472 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:55:45,850 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:55:45,851 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:55:45,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:55:46,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-28 04:55:46,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 04:55:46,443 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 15 treesize of output 3 [2024-11-28 04:55:46,451 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 9 treesize of output 3 [2024-11-28 04:55:46,824 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 04:55:46,825 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 15 treesize of output 15 [2024-11-28 04:55:46,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-11-28 04:55:47,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 19 [2024-11-28 04:55:47,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-11-28 04:55:47,756 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 23 treesize of output 15 [2024-11-28 04:55:47,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:55:47,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-11-28 04:55:47,965 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:55:47,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:55:49,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809058116] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:55:49,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:55:49,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 58 [2024-11-28 04:55:49,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883772956] [2024-11-28 04:55:49,097 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:55:49,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-28 04:55:49,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:55:49,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-28 04:55:49,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=4174, Unknown=16, NotChecked=0, Total=4422 [2024-11-28 04:55:49,099 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand has 58 states, 56 states have (on average 1.9285714285714286) internal successors, (108), 49 states have internal predecessors, (108), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:55:51,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:55:51,740 INFO L93 Difference]: Finished difference Result 143 states and 157 transitions. [2024-11-28 04:55:51,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-28 04:55:51,740 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 56 states have (on average 1.9285714285714286) internal successors, (108), 49 states have internal predecessors, (108), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 64 [2024-11-28 04:55:51,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:55:51,742 INFO L225 Difference]: With dead ends: 143 [2024-11-28 04:55:51,742 INFO L226 Difference]: Without dead ends: 143 [2024-11-28 04:55:51,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1727 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=397, Invalid=6897, Unknown=16, NotChecked=0, Total=7310 [2024-11-28 04:55:51,744 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 51 mSDsluCounter, 1345 mSDsCounter, 0 mSdLazyCounter, 1682 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 1685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:55:51,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1398 Invalid, 1685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1682 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-28 04:55:51,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-28 04:55:51,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 128. [2024-11-28 04:55:51,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 107 states have (on average 1.2149532710280373) internal successors, (130), 120 states have internal predecessors, (130), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 04:55:51,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2024-11-28 04:55:51,751 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 64 [2024-11-28 04:55:51,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:55:51,751 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2024-11-28 04:55:51,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 56 states have (on average 1.9285714285714286) internal successors, (108), 49 states have internal predecessors, (108), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:55:51,751 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2024-11-28 04:55:51,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-28 04:55:51,752 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:55:51,753 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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:55:51,766 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-28 04:55:51,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-28 04:55:51,954 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:55:51,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:55:51,954 INFO L85 PathProgramCache]: Analyzing trace with hash 2050310075, now seen corresponding path program 1 times [2024-11-28 04:55:51,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:55:51,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745162853] [2024-11-28 04:55:51,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:55:51,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:55:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:55:53,562 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 04:55:53,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:55:53,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745162853] [2024-11-28 04:55:53,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745162853] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:55:53,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586037858] [2024-11-28 04:55:53,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:55:53,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:55:53,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:55:53,565 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:55:53,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-28 04:55:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:55:53,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 136 conjuncts are in the unsatisfiable core [2024-11-28 04:55:53,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:55:53,915 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:55:54,101 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 04:55:54,102 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:55:54,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:55:54,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:55:54,427 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:55:54,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 58 [2024-11-28 04:55:54,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 04:55:54,768 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 55 treesize of output 23 [2024-11-28 04:55:54,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 04:55:54,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-28 04:55:54,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 04:55:55,384 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 04:55:55,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-28 04:55:55,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:55:55,403 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 63 treesize of output 40 [2024-11-28 04:55:55,425 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-28 04:55:55,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 29 [2024-11-28 04:55:55,466 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-28 04:55:55,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-28 04:55:56,505 INFO L349 Elim1Store]: treesize reduction 65, result has 14.5 percent of original size [2024-11-28 04:55:56,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 49 [2024-11-28 04:55:56,524 INFO L349 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2024-11-28 04:55:56,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2024-11-28 04:55:56,730 INFO L349 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2024-11-28 04:55:56,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 122 [2024-11-28 04:55:56,756 INFO L349 Elim1Store]: treesize reduction 41, result has 29.3 percent of original size [2024-11-28 04:55:56,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 43 [2024-11-28 04:55:56,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-28 04:55:56,777 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 37 treesize of output 21 [2024-11-28 04:55:56,903 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 60 treesize of output 36 [2024-11-28 04:55:57,108 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 33 treesize of output 17 [2024-11-28 04:55:57,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 04:55:57,252 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:55:57,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:56:00,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586037858] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:56:00,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:56:00,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 34] total 55 [2024-11-28 04:56:00,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507698762] [2024-11-28 04:56:00,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:56:00,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-28 04:56:00,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:56:00,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-28 04:56:00,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=4375, Unknown=55, NotChecked=0, Total=4692 [2024-11-28 04:56:00,229 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 55 states, 53 states have (on average 1.9622641509433962) internal successors, (104), 48 states have internal predecessors, (104), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-28 04:56:03,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:56:03,736 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2024-11-28 04:56:03,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-28 04:56:03,737 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 53 states have (on average 1.9622641509433962) internal successors, (104), 48 states have internal predecessors, (104), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 65 [2024-11-28 04:56:03,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:56:03,738 INFO L225 Difference]: With dead ends: 119 [2024-11-28 04:56:03,738 INFO L226 Difference]: Without dead ends: 119 [2024-11-28 04:56:03,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1971 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=466, Invalid=6960, Unknown=56, NotChecked=0, Total=7482 [2024-11-28 04:56:03,740 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 37 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 1835 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 1845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-28 04:56:03,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1218 Invalid, 1845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1835 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-28 04:56:03,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-28 04:56:03,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-28 04:56:03,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 98 states have (on average 1.2142857142857142) internal successors, (119), 111 states have internal predecessors, (119), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 04:56:03,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2024-11-28 04:56:03,749 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 65 [2024-11-28 04:56:03,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:56:03,750 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2024-11-28 04:56:03,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 53 states have (on average 1.9622641509433962) internal successors, (104), 48 states have internal predecessors, (104), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-28 04:56:03,750 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2024-11-28 04:56:03,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-28 04:56:03,754 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:56:03,754 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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:56:03,768 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-28 04:56:03,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-28 04:56:03,955 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:56:03,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:56:03,956 INFO L85 PathProgramCache]: Analyzing trace with hash -101517337, now seen corresponding path program 1 times [2024-11-28 04:56:03,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:56:03,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689073805] [2024-11-28 04:56:03,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:56:03,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:56:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:56:06,515 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:56:06,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:56:06,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689073805] [2024-11-28 04:56:06,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689073805] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:56:06,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042062738] [2024-11-28 04:56:06,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:56:06,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:56:06,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:56:06,518 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:56:06,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-28 04:56:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:56:06,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 126 conjuncts are in the unsatisfiable core [2024-11-28 04:56:06,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:56:06,965 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:56:07,438 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:56:07,438 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:56:07,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 04:56:07,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:56:07,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-28 04:56:07,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:56:07,851 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:56:07,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 04:56:07,856 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 28 treesize of output 11 [2024-11-28 04:56:08,279 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 15 treesize of output 3 [2024-11-28 04:56:08,284 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 22 treesize of output 8 [2024-11-28 04:56:08,289 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 9 treesize of output 3 [2024-11-28 04:56:08,799 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 04:56:08,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 27 [2024-11-28 04:56:08,805 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 9 treesize of output 3 [2024-11-28 04:56:08,843 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 04:56:08,843 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 15 treesize of output 15 [2024-11-28 04:56:08,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2024-11-28 04:56:09,943 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-28 04:56:09,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 15 [2024-11-28 04:56:10,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-11-28 04:56:10,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-11-28 04:56:10,395 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 23 treesize of output 15 [2024-11-28 04:56:10,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:56:10,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-11-28 04:56:10,696 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:56:10,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:56:12,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042062738] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:56:12,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:56:12,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 65 [2024-11-28 04:56:12,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689717715] [2024-11-28 04:56:12,855 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:56:12,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-11-28 04:56:12,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:56:12,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-11-28 04:56:12,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=5694, Unknown=7, NotChecked=0, Total=6006 [2024-11-28 04:56:12,858 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand has 65 states, 63 states have (on average 1.8412698412698412) internal successors, (116), 56 states have internal predecessors, (116), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:56:16,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:56:16,294 INFO L93 Difference]: Finished difference Result 142 states and 154 transitions. [2024-11-28 04:56:16,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-28 04:56:16,295 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 63 states have (on average 1.8412698412698412) internal successors, (116), 56 states have internal predecessors, (116), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 68 [2024-11-28 04:56:16,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:56:16,295 INFO L225 Difference]: With dead ends: 142 [2024-11-28 04:56:16,295 INFO L226 Difference]: Without dead ends: 142 [2024-11-28 04:56:16,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2426 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=501, Invalid=9194, Unknown=7, NotChecked=0, Total=9702 [2024-11-28 04:56:16,297 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 87 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 1894 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 1899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:56:16,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1396 Invalid, 1899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1894 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-28 04:56:16,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-28 04:56:16,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 127. [2024-11-28 04:56:16,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 106 states have (on average 1.1981132075471699) internal successors, (127), 119 states have internal predecessors, (127), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 04:56:16,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2024-11-28 04:56:16,304 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 68 [2024-11-28 04:56:16,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:56:16,304 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2024-11-28 04:56:16,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 63 states have (on average 1.8412698412698412) internal successors, (116), 56 states have internal predecessors, (116), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:56:16,305 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2024-11-28 04:56:16,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-28 04:56:16,305 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:56:16,306 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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:56:16,319 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-28 04:56:16,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-28 04:56:16,506 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:56:16,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:56:16,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1148543187, now seen corresponding path program 1 times [2024-11-28 04:56:16,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:56:16,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522908064] [2024-11-28 04:56:16,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:56:16,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:56:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:56:19,859 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:56:19,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:56:19,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522908064] [2024-11-28 04:56:19,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522908064] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:56:19,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680386577] [2024-11-28 04:56:19,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:56:19,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:56:19,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:56:19,862 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:56:19,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-28 04:56:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:56:20,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 131 conjuncts are in the unsatisfiable core [2024-11-28 04:56:20,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:56:20,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:56:20,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:56:20,897 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 04:56:20,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-28 04:56:20,922 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 04:56:20,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-28 04:56:21,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:56:21,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:56:21,396 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:56:21,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 58 [2024-11-28 04:56:21,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 04:56:21,899 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 55 treesize of output 23 [2024-11-28 04:56:21,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-28 04:56:21,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 04:56:21,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 04:56:22,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:56:22,536 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 63 treesize of output 40 [2024-11-28 04:56:22,563 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-28 04:56:22,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-28 04:56:22,572 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 22 treesize of output 17 [2024-11-28 04:56:22,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-28 04:56:23,952 INFO L349 Elim1Store]: treesize reduction 84, result has 27.0 percent of original size [2024-11-28 04:56:23,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 83 [2024-11-28 04:56:23,986 INFO L349 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2024-11-28 04:56:23,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 45 [2024-11-28 04:56:24,214 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-11-28 04:56:24,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 98 [2024-11-28 04:56:24,241 INFO L349 Elim1Store]: treesize reduction 33, result has 28.3 percent of original size [2024-11-28 04:56:24,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 35 [2024-11-28 04:56:24,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 04:56:24,270 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 29 treesize of output 21 [2024-11-28 04:56:24,435 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 60 treesize of output 36 [2024-11-28 04:56:24,698 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 33 treesize of output 17 [2024-11-28 04:56:24,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 04:56:24,871 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:56:24,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:56:42,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680386577] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:56:42,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:56:42,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 65 [2024-11-28 04:56:42,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200260453] [2024-11-28 04:56:42,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:56:42,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-11-28 04:56:42,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:56:42,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-11-28 04:56:42,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=5950, Unknown=70, NotChecked=0, Total=6320 [2024-11-28 04:56:42,454 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand has 66 states, 63 states have (on average 1.9523809523809523) internal successors, (123), 57 states have internal predecessors, (123), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-28 04:56:59,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:56:59,009 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2024-11-28 04:56:59,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-28 04:56:59,011 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 63 states have (on average 1.9523809523809523) internal successors, (123), 57 states have internal predecessors, (123), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 69 [2024-11-28 04:56:59,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:56:59,012 INFO L225 Difference]: With dead ends: 140 [2024-11-28 04:56:59,012 INFO L226 Difference]: Without dead ends: 140 [2024-11-28 04:56:59,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2854 ImplicationChecksByTransitivity, 29.9s TimeCoverageRelationStatistics Valid=779, Invalid=12256, Unknown=75, NotChecked=0, Total=13110 [2024-11-28 04:56:59,014 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 167 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 2867 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 2888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2024-11-28 04:56:59,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1336 Invalid, 2888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2867 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2024-11-28 04:56:59,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-28 04:56:59,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 132. [2024-11-28 04:56:59,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 111 states have (on average 1.2072072072072073) internal successors, (134), 124 states have internal predecessors, (134), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 04:56:59,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2024-11-28 04:56:59,023 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 69 [2024-11-28 04:56:59,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:56:59,023 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2024-11-28 04:56:59,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 63 states have (on average 1.9523809523809523) internal successors, (123), 57 states have internal predecessors, (123), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-28 04:56:59,024 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2024-11-28 04:56:59,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-28 04:56:59,025 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:56:59,025 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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:56:59,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-28 04:56:59,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-28 04:56:59,226 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:56:59,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:56:59,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1148543186, now seen corresponding path program 1 times [2024-11-28 04:56:59,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:56:59,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025870531] [2024-11-28 04:56:59,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:56:59,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:56:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:57:03,267 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:57:03,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:57:03,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025870531] [2024-11-28 04:57:03,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025870531] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:57:03,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486073195] [2024-11-28 04:57:03,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:57:03,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:57:03,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:57:03,269 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:57:03,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-28 04:57:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:57:03,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-28 04:57:03,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:57:05,055 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:57:05,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 [2024-11-28 04:57:05,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:57:05,919 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:57:05,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2024-11-28 04:57:06,846 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 60 treesize of output 18 [2024-11-28 04:57:06,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 04:57:07,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:57:07,588 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 68 treesize of output 51 [2024-11-28 04:57:07,701 INFO L349 Elim1Store]: treesize reduction 90, result has 37.9 percent of original size [2024-11-28 04:57:07,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 69 [2024-11-28 04:57:09,428 INFO L349 Elim1Store]: treesize reduction 71, result has 19.3 percent of original size [2024-11-28 04:57:09,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 51 [2024-11-28 04:57:09,909 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-11-28 04:57:09,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 129 treesize of output 115 [2024-11-28 04:57:09,937 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 44 treesize of output 32 [2024-11-28 04:57:10,361 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 102 treesize of output 70 [2024-11-28 04:57:10,374 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 65 treesize of output 45 [2024-11-28 04:57:11,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 21 [2024-11-28 04:57:11,891 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 14 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:57:11,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:57:15,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486073195] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:57:15,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:57:15,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 32] total 63 [2024-11-28 04:57:15,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870545117] [2024-11-28 04:57:15,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:57:15,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-11-28 04:57:15,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:57:15,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-11-28 04:57:15,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=4969, Unknown=41, NotChecked=0, Total=5256 [2024-11-28 04:57:15,064 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand has 64 states, 61 states have (on average 2.0163934426229506) internal successors, (123), 56 states have internal predecessors, (123), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-28 04:57:27,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:57:27,851 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2024-11-28 04:57:27,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-28 04:57:27,852 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 61 states have (on average 2.0163934426229506) internal successors, (123), 56 states have internal predecessors, (123), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 69 [2024-11-28 04:57:27,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:57:27,853 INFO L225 Difference]: With dead ends: 144 [2024-11-28 04:57:27,853 INFO L226 Difference]: Without dead ends: 144 [2024-11-28 04:57:27,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2507 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=691, Invalid=10824, Unknown=41, NotChecked=0, Total=11556 [2024-11-28 04:57:27,855 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 132 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 2460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:57:27,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1504 Invalid, 2460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-11-28 04:57:27,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-28 04:57:27,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 132. [2024-11-28 04:57:27,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 111 states have (on average 1.1981981981981982) internal successors, (133), 124 states have internal predecessors, (133), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 04:57:27,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2024-11-28 04:57:27,863 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 69 [2024-11-28 04:57:27,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:57:27,863 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2024-11-28 04:57:27,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 61 states have (on average 2.0163934426229506) internal successors, (123), 56 states have internal predecessors, (123), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-28 04:57:27,866 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2024-11-28 04:57:27,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-28 04:57:27,867 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:57:27,867 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:27,878 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-28 04:57:28,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-28 04:57:28,068 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:57:28,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:57:28,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1450555517, now seen corresponding path program 1 times [2024-11-28 04:57:28,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:57:28,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977809720] [2024-11-28 04:57:28,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:57:28,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:57:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:57:35,606 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:57:35,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:57:35,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977809720] [2024-11-28 04:57:35,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977809720] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:57:35,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634329662] [2024-11-28 04:57:35,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:57:35,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:57:35,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:57:35,609 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:57:35,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-28 04:57:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:57:36,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 162 conjuncts are in the unsatisfiable core [2024-11-28 04:57:36,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:57:36,322 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:57:36,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:57:37,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-28 04:57:37,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 04:57:38,843 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:57:38,844 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:57:38,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 04:57:39,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 04:57:39,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:57:39,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:57:39,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 04:57:40,103 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:57:40,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 95 [2024-11-28 04:57:40,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 17 [2024-11-28 04:57:40,138 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 30 treesize of output 13 [2024-11-28 04:57:41,492 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 63 treesize of output 21 [2024-11-28 04:57:41,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2024-11-28 04:57:41,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 04:57:41,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 04:57:42,058 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 04:57:42,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 1 case distinctions, treesize of input 26 treesize of output 29 [2024-11-28 04:57:42,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-28 04:57:42,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:57:42,095 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 71 treesize of output 54 [2024-11-28 04:57:42,145 INFO L349 Elim1Store]: treesize reduction 41, result has 47.4 percent of original size [2024-11-28 04:57:42,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 43 [2024-11-28 04:57:42,221 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-28 04:57:42,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-11-28 04:57:45,000 INFO L349 Elim1Store]: treesize reduction 37, result has 19.6 percent of original size [2024-11-28 04:57:45,001 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 195 treesize of output 146 [2024-11-28 04:57:45,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 54 treesize of output 21 [2024-11-28 04:57:45,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:57:45,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 83 treesize of output 25 [2024-11-28 04:57:45,387 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 70 treesize of output 53 [2024-11-28 04:57:45,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 25 [2024-11-28 04:57:45,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-28 04:57:45,824 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 68 treesize of output 48 [2024-11-28 04:57:45,830 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 52 treesize of output 36 [2024-11-28 04:57:46,594 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 33 treesize of output 15 [2024-11-28 04:57:46,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:57:47,539 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:57:47,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:57:50,261 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4385 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_26| Int) (v_ArrVal_4386 (Array Int Int)) (v_ArrVal_4387 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4385) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4387) .cse0) .cse1)) |v_ULTIMATE.start_main_~ptr~0#1.offset_26|)) (< (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4386) .cse0) .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_26|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_26| 0)))) is different from false [2024-11-28 04:57:50,306 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4383 (Array Int Int)) (v_ArrVal_4384 (Array Int Int)) (v_ArrVal_4385 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_26| Int) (v_ArrVal_4386 (Array Int Int)) (v_ArrVal_4387 (Array Int Int)) (v_ArrVal_4382 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (< (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_4384) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4386) .cse0) .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_26|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_4382) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4385) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_4383) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4387) .cse0) .cse1)) |v_ULTIMATE.start_main_~ptr~0#1.offset_26|)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_26| 0) (not (= v_ArrVal_4382 (let ((.cse2 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse2 (select v_ArrVal_4382 .cse2)))))))) is different from false [2024-11-28 04:57:50,473 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4383 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_60| Int) (v_ArrVal_4384 (Array Int Int)) (v_ArrVal_4385 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_26| Int) (v_ArrVal_4386 (Array Int Int)) (v_ArrVal_4387 (Array Int Int)) (v_ArrVal_4382 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (= (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_append_#t~mem11#1.base| v_ArrVal_4382) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4385) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_#t~mem11#1.base| v_ArrVal_4383) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4387) .cse0) .cse1)) |v_ULTIMATE.start_main_~ptr~0#1.offset_26|) |c_ULTIMATE.start_main_~data~0#1|) (< (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_#t~mem11#1.base| v_ArrVal_4384) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4386) .cse0) .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_26|) (not (= v_ArrVal_4382 (let ((.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_60| 4))) (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) .cse2 (select v_ArrVal_4382 .cse2))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_26| 0) (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_60| |c_ULTIMATE.start_dll_append_#t~mem11#1.offset|)))) is different from false [2024-11-28 04:57:54,607 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4383 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_60| Int) (v_ArrVal_4384 (Array Int Int)) (v_ArrVal_4385 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_26| Int) (v_ArrVal_4386 (Array Int Int)) (v_ArrVal_4387 (Array Int Int)) (v_ArrVal_4382 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (< (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_4384) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4386) .cse1) .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_26|) (not (= (let ((.cse3 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_60| 4))) (store (select |c_#memory_int#2| .cse0) .cse3 (select v_ArrVal_4382 .cse3))) v_ArrVal_4382)) (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_60| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_26| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| .cse0 v_ArrVal_4382) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4385) (select (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_4383) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4387) .cse1) .cse2)) |v_ULTIMATE.start_main_~ptr~0#1.offset_26|)))))) is different from false [2024-11-28 04:57:54,716 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4383 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_60| Int) (v_ArrVal_4384 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_26| Int) (v_ArrVal_4385 (Array Int Int)) (v_ArrVal_4386 (Array Int Int)) (v_ArrVal_4387 (Array Int Int)) (v_ArrVal_4382 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (< (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_4384) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4386) .cse1) .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_26|) (not (= (let ((.cse3 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_60| 4))) (store (select |c_#memory_int#2| .cse0) .cse3 (select v_ArrVal_4382 .cse3))) v_ArrVal_4382)) (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_60| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_26| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| .cse0 v_ArrVal_4382) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4385) (select (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_4383) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4387) .cse1) .cse2)) |v_ULTIMATE.start_main_~ptr~0#1.offset_26|)))))) is different from false [2024-11-28 04:57:54,770 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4383 (Array Int Int)) (v_ArrVal_4384 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_60| Int) (v_ArrVal_4385 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_26| Int) (v_ArrVal_4386 (Array Int Int)) (v_ArrVal_4387 (Array Int Int)) (v_ArrVal_4382 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (not (= v_ArrVal_4382 (let ((.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_60| 4))) (store (select |c_#memory_int#2| .cse0) .cse1 (select v_ArrVal_4382 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| .cse0 v_ArrVal_4382) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4385) (select (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_4383) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4387) .cse2) .cse3)) |v_ULTIMATE.start_main_~ptr~0#1.offset_26|)) (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_60| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse4)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_26| 0) (< (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_4384) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4386) .cse2) .cse3) |v_ULTIMATE.start_main_~ptr~0#1.offset_26|))))) is different from false [2024-11-28 04:57:54,834 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4383 (Array Int Int)) (v_ArrVal_4384 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_60| Int) (v_ArrVal_4385 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_26| Int) (v_ArrVal_4386 (Array Int Int)) (v_ArrVal_4387 (Array Int Int)) (v_ArrVal_4382 (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse4) .cse5)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (< (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_4384) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4386) .cse1) .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_26|) (not (= v_ArrVal_4382 (let ((.cse3 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_60| 4))) (store (select |c_#memory_int#2| .cse0) .cse3 (select v_ArrVal_4382 .cse3))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_26| 0) (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_60| (select (select |c_#memory_$Pointer$#2.offset| .cse4) .cse5)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| .cse0 v_ArrVal_4382) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4385) (select (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_4383) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4387) .cse1) .cse2)) |v_ULTIMATE.start_main_~ptr~0#1.offset_26|)))))) is different from false [2024-11-28 04:57:54,935 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4383 (Array Int Int)) (v_ArrVal_4384 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_60| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_26| Int) (v_ArrVal_4385 (Array Int Int)) (v_ArrVal_4386 (Array Int Int)) (v_ArrVal_4387 (Array Int Int)) (v_ArrVal_4382 (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse4) .cse5)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (< (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_4384) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4386) .cse1) .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_26|) (not (= v_ArrVal_4382 (let ((.cse3 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_60| 4))) (store (select |c_#memory_int#2| .cse0) .cse3 (select v_ArrVal_4382 .cse3))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_26| 0) (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_60| (select (select |c_#memory_$Pointer$#2.offset| .cse4) .cse5)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| .cse0 v_ArrVal_4382) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4385) (select (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_4383) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4387) .cse1) .cse2)) |v_ULTIMATE.start_main_~ptr~0#1.offset_26|)))))) is different from false [2024-11-28 04:57:55,001 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4383 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_60| Int) (v_ArrVal_4384 (Array Int Int)) (v_ArrVal_4385 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_26| Int) (v_ArrVal_4386 (Array Int Int)) (v_ArrVal_4387 (Array Int Int)) (v_ArrVal_4382 (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse4) .cse5)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (not (= v_ArrVal_4382 (let ((.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_60| 4))) (store (select |c_#memory_int#2| .cse0) .cse1 (select v_ArrVal_4382 .cse1))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_26| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| .cse0 v_ArrVal_4382) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_4385) (select (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_4383) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_4387) .cse2) .cse3)) |v_ULTIMATE.start_main_~ptr~0#1.offset_26|)) (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_60| (select (select |c_#memory_$Pointer$#2.offset| .cse4) .cse5)) (< (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_4384) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_4386) .cse2) .cse3) |v_ULTIMATE.start_main_~ptr~0#1.offset_26|))))) is different from false [2024-11-28 04:57:55,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634329662] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:57:55,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:57:55,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 39] total 71 [2024-11-28 04:57:55,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585434624] [2024-11-28 04:57:55,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:57:55,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-11-28 04:57:55,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:57:55,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-11-28 04:57:55,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=5621, Unknown=9, NotChecked=1422, Total=7310 [2024-11-28 04:57:55,965 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand has 71 states, 69 states have (on average 1.8115942028985508) internal successors, (125), 63 states have internal predecessors, (125), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:58:09,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:58:09,825 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2024-11-28 04:58:09,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-28 04:58:09,826 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 69 states have (on average 1.8115942028985508) internal successors, (125), 63 states have internal predecessors, (125), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 73 [2024-11-28 04:58:09,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:58:09,826 INFO L225 Difference]: With dead ends: 152 [2024-11-28 04:58:09,826 INFO L226 Difference]: Without dead ends: 152 [2024-11-28 04:58:09,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1790 ImplicationChecksByTransitivity, 26.4s TimeCoverageRelationStatistics Valid=486, Invalid=9843, Unknown=9, NotChecked=1872, Total=12210 [2024-11-28 04:58:09,828 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 92 mSDsluCounter, 2110 mSDsCounter, 0 mSdLazyCounter, 3104 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 2156 SdHoareTripleChecker+Invalid, 3113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 3104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:58:09,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 2156 Invalid, 3113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 3104 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2024-11-28 04:58:09,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-28 04:58:09,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 137. [2024-11-28 04:58:09,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 116 states have (on average 1.1896551724137931) internal successors, (138), 129 states have internal predecessors, (138), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 04:58:09,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2024-11-28 04:58:09,834 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 73 [2024-11-28 04:58:09,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:58:09,835 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2024-11-28 04:58:09,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 69 states have (on average 1.8115942028985508) internal successors, (125), 63 states have internal predecessors, (125), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:58:09,835 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2024-11-28 04:58:09,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 04:58:09,836 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:58:09,836 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:58:09,849 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-28 04:58:10,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-28 04:58:10,037 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:58:10,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:58:10,037 INFO L85 PathProgramCache]: Analyzing trace with hash 95303468, now seen corresponding path program 3 times [2024-11-28 04:58:10,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:58:10,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432646036] [2024-11-28 04:58:10,037 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 04:58:10,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:58:10,110 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-28 04:58:10,110 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:58:14,942 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 56 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 04:58:14,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:58:14,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432646036] [2024-11-28 04:58:14,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432646036] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:58:14,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192941763] [2024-11-28 04:58:14,943 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 04:58:14,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:58:14,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:58:14,945 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:58:14,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-28 04:58:15,739 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-28 04:58:15,739 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:58:15,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 136 conjuncts are in the unsatisfiable core [2024-11-28 04:58:15,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:58:15,979 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:58:16,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:58:17,104 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-28 04:58:17,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 25 [2024-11-28 04:58:18,181 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (or (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_56| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse1 (select |c_#valid| .cse1)))))))) (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse2 (select |c_#valid| .cse2)))) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse4 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3 (select |c_#memory_$Pointer$#2.base| .cse3)) |c_#memory_$Pointer$#2.base|) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_#valid_BEFORE_CALL_56| .cse4) 1) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| .cse3))))))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0)) is different from false [2024-11-28 04:58:18,190 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (or (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_56| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse1 (select |c_#valid| .cse1)))))))) (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse2 (select |c_#valid| .cse2)))) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse4 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3 (select |c_#memory_$Pointer$#2.base| .cse3)) |c_#memory_$Pointer$#2.base|) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_#valid_BEFORE_CALL_56| .cse4) 1) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| .cse3))))))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0)) is different from true [2024-11-28 04:58:18,326 WARN L851 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_#valid_BEFORE_CALL_56| .cse3) 1) (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse4 (select |c_#valid| .cse4)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)) is different from false [2024-11-28 04:58:18,333 WARN L873 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_#valid_BEFORE_CALL_56| .cse3) 1) (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse4 (select |c_#valid| .cse4)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)) is different from true [2024-11-28 04:58:18,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:58:18,472 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-28 04:58:18,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 30 [2024-11-28 04:58:18,529 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (or (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int)))) (and (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse2 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|))) (and (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_#valid_BEFORE_CALL_56| .cse2) 1) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3 (select |v_#memory_$Pointer$#2.base_294| .cse3))) (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse4 (select |c_#valid| .cse4)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (= (store |v_#memory_$Pointer$#2.base_294| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) |c_#memory_$Pointer$#2.base|))))) is different from false [2024-11-28 04:58:18,536 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (or (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int)))) (and (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse2 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|))) (and (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_#valid_BEFORE_CALL_56| .cse2) 1) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3 (select |v_#memory_$Pointer$#2.base_294| .cse3))) (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse4 (select |c_#valid| .cse4)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (= (store |v_#memory_$Pointer$#2.base_294| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) |c_#memory_$Pointer$#2.base|))))) is different from true [2024-11-28 04:58:18,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:58:18,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:58:18,641 INFO L349 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2024-11-28 04:58:18,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 35 [2024-11-28 04:58:18,700 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-28 04:58:18,801 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse2 (= (select .cse5 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) .cse2)) (and .cse2 (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_#valid_BEFORE_CALL_56| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|))) (and (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_#valid_BEFORE_CALL_56| .cse3) 1) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse4 (select |v_#memory_$Pointer$#2.base_294| .cse4))) (= .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (store |v_#memory_$Pointer$#2.base_294| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse5) |c_#memory_$Pointer$#2.base|) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse6 (select |c_#valid| .cse6)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))))))))) is different from false [2024-11-28 04:58:18,809 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse2 (= (select .cse5 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) .cse2)) (and .cse2 (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_#valid_BEFORE_CALL_56| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|))) (and (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_#valid_BEFORE_CALL_56| .cse3) 1) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse4 (select |v_#memory_$Pointer$#2.base_294| .cse4))) (= .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (store |v_#memory_$Pointer$#2.base_294| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse5) |c_#memory_$Pointer$#2.base|) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse6 (select |c_#valid| .cse6)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))))))))) is different from true [2024-11-28 04:58:19,112 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 04:58:19,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-28 04:58:19,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:58:19,317 INFO L349 Elim1Store]: treesize reduction 51, result has 25.0 percent of original size [2024-11-28 04:58:19,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 46 [2024-11-28 04:58:19,462 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 69 treesize of output 51 [2024-11-28 04:58:19,470 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 6 treesize of output 4 [2024-11-28 04:58:19,730 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse0 (select .cse7 4))) (let ((.cse3 (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (.cse5 (select |c_#memory_$Pointer$#2.base| .cse0)) (.cse4 (= (select |c_#valid| .cse0) 1))) (or (let ((.cse1 (select .cse5 4))) (and (or (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)))) (= .cse0 .cse1)) (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) .cse3 .cse4)) (and .cse3 (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_#valid_BEFORE_CALL_56| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse8 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse6 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse0) 4))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse6) 1) (= (store (store |v_#memory_$Pointer$#2.base_294| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse7) .cse0 (store (select |v_#memory_$Pointer$#2.base_294| .cse0) 8 (select .cse5 8))) |c_#memory_$Pointer$#2.base|) (= (select |v_#valid_BEFORE_CALL_56| .cse0) 1) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse8 (select |v_#memory_$Pointer$#2.base_294| .cse8))) (= .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= .cse0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse6) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8))) (= |c_#valid| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse9 (select |c_#valid| .cse9)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))) .cse4)))))) is different from false [2024-11-28 04:58:19,737 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse0 (select .cse7 4))) (let ((.cse3 (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (.cse5 (select |c_#memory_$Pointer$#2.base| .cse0)) (.cse4 (= (select |c_#valid| .cse0) 1))) (or (let ((.cse1 (select .cse5 4))) (and (or (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)))) (= .cse0 .cse1)) (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) .cse3 .cse4)) (and .cse3 (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_#valid_BEFORE_CALL_56| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse8 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse6 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse0) 4))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse6) 1) (= (store (store |v_#memory_$Pointer$#2.base_294| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse7) .cse0 (store (select |v_#memory_$Pointer$#2.base_294| .cse0) 8 (select .cse5 8))) |c_#memory_$Pointer$#2.base|) (= (select |v_#valid_BEFORE_CALL_56| .cse0) 1) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse8 (select |v_#memory_$Pointer$#2.base_294| .cse8))) (= .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= .cse0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse6) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8))) (= |c_#valid| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse9 (select |c_#valid| .cse9)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))) .cse4)))))) is different from true [2024-11-28 04:58:19,932 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse4 (select .cse9 4))) (let ((.cse0 (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (= .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (.cse1 (= (select |c_#valid| .cse4) 1)) (.cse5 (select |c_#memory_$Pointer$#2.base| .cse4))) (or (let ((.cse3 (select .cse5 4))) (and .cse0 .cse1 (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_56| .cse3) 1))) (or (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse4)) (= .cse4 .cse3)))) (and .cse0 .cse1 (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_#valid_BEFORE_CALL_56| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse6 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse7 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse4) 4))) (and (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse6 (select |v_#memory_$Pointer$#2.base_294| .cse6))) (= (select |v_#valid_BEFORE_CALL_56| .cse4) 1) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse7) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse4) (= .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= |c_#valid| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse8 (select |c_#valid| .cse8)))) (= (store (store |v_#memory_$Pointer$#2.base_294| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse9) .cse4 (store (select |v_#memory_$Pointer$#2.base_294| .cse4) 8 (select .cse5 8))) |c_#memory_$Pointer$#2.base|) (= (select |v_#valid_BEFORE_CALL_56| .cse7) 1))))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from false [2024-11-28 04:58:19,939 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse4 (select .cse9 4))) (let ((.cse0 (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (= .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (.cse1 (= (select |c_#valid| .cse4) 1)) (.cse5 (select |c_#memory_$Pointer$#2.base| .cse4))) (or (let ((.cse3 (select .cse5 4))) (and .cse0 .cse1 (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_56| .cse3) 1))) (or (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse4)) (= .cse4 .cse3)))) (and .cse0 .cse1 (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_#valid_BEFORE_CALL_56| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse6 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse7 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse4) 4))) (and (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse6 (select |v_#memory_$Pointer$#2.base_294| .cse6))) (= (select |v_#valid_BEFORE_CALL_56| .cse4) 1) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse7) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse4) (= .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= |c_#valid| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse8 (select |c_#valid| .cse8)))) (= (store (store |v_#memory_$Pointer$#2.base_294| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse9) .cse4 (store (select |v_#memory_$Pointer$#2.base_294| .cse4) 8 (select .cse5 8))) |c_#memory_$Pointer$#2.base|) (= (select |v_#valid_BEFORE_CALL_56| .cse7) 1))))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from true [2024-11-28 04:58:20,302 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse3 (select .cse8 4))) (let ((.cse0 (or (= .cse3 |c_ULTIMATE.start_dll_create_#res#1.base|) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4)))) (.cse5 (select |c_#memory_$Pointer$#2.base| .cse3)) (.cse4 (= (select |c_#valid| .cse3) 1))) (or (let ((.cse1 (select .cse5 4))) (and .cse0 (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) (or (= .cse1 .cse3) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse3))) .cse4)) (and .cse0 (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_#valid_BEFORE_CALL_56| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse6 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3) 4)) (.cse7 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse6) 1) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse7 (select |v_#memory_$Pointer$#2.base_294| .cse7))) (= (store (store |v_#memory_$Pointer$#2.base_294| |c_ULTIMATE.start_dll_create_#res#1.base| .cse8) .cse3 (store (select |v_#memory_$Pointer$#2.base_294| .cse3) 8 (select .cse5 8))) |c_#memory_$Pointer$#2.base|) (= .cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse6) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8))) (= |c_#valid| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse9 (select |c_#valid| .cse9)))) (= .cse7 |c_ULTIMATE.start_dll_create_#res#1.base|) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_56| .cse3) 1)))) .cse4))))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0)) is different from false [2024-11-28 04:58:20,309 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse3 (select .cse8 4))) (let ((.cse0 (or (= .cse3 |c_ULTIMATE.start_dll_create_#res#1.base|) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4)))) (.cse5 (select |c_#memory_$Pointer$#2.base| .cse3)) (.cse4 (= (select |c_#valid| .cse3) 1))) (or (let ((.cse1 (select .cse5 4))) (and .cse0 (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) (or (= .cse1 .cse3) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse3))) .cse4)) (and .cse0 (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_#valid_BEFORE_CALL_56| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse6 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3) 4)) (.cse7 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse6) 1) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse7 (select |v_#memory_$Pointer$#2.base_294| .cse7))) (= (store (store |v_#memory_$Pointer$#2.base_294| |c_ULTIMATE.start_dll_create_#res#1.base| .cse8) .cse3 (store (select |v_#memory_$Pointer$#2.base_294| .cse3) 8 (select .cse5 8))) |c_#memory_$Pointer$#2.base|) (= .cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse6) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8))) (= |c_#valid| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse9 (select |c_#valid| .cse9)))) (= .cse7 |c_ULTIMATE.start_dll_create_#res#1.base|) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_56| .cse3) 1)))) .cse4))))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0)) is different from true [2024-11-28 04:58:20,511 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) 0))) (and (= (select |c_#valid| .cse0) 1) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse5 (select .cse8 4))) (let ((.cse1 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= .cse5 .cse0))) (.cse2 (= (select |c_#valid| .cse5) 1)) (.cse6 (select |c_#memory_$Pointer$#2.base| .cse5))) (or (let ((.cse3 (select .cse6 4))) (and .cse1 .cse2 (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_56| .cse3) 1) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse4 (select |c_#valid| .cse4)))))) (or (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= .cse5 (select (select |c_#memory_$Pointer$#2.base| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)))) (= .cse5 .cse3)))) (and .cse1 .cse2 (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_#valid_BEFORE_CALL_56| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse7 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse9 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse5) 4))) (and (= .cse7 .cse0) (= (select |v_#valid_BEFORE_CALL_56| .cse5) 1) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse7 (select |v_#memory_$Pointer$#2.base_294| .cse7))) (= |c_#memory_$Pointer$#2.base| (store (store |v_#memory_$Pointer$#2.base_294| .cse0 .cse8) .cse5 (store (select |v_#memory_$Pointer$#2.base_294| .cse5) 8 (select .cse6 8)))) (= (select |v_#valid_BEFORE_CALL_56| .cse0) 0) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse9) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse5) (= |c_#valid| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse10 (select |c_#valid| .cse10)))) (= (select |v_#valid_BEFORE_CALL_56| .cse9) 1))))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))) is different from false [2024-11-28 04:58:20,518 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) 0))) (and (= (select |c_#valid| .cse0) 1) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse5 (select .cse8 4))) (let ((.cse1 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= .cse5 .cse0))) (.cse2 (= (select |c_#valid| .cse5) 1)) (.cse6 (select |c_#memory_$Pointer$#2.base| .cse5))) (or (let ((.cse3 (select .cse6 4))) (and .cse1 .cse2 (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_56| .cse3) 1) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse4 (select |c_#valid| .cse4)))))) (or (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= .cse5 (select (select |c_#memory_$Pointer$#2.base| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)))) (= .cse5 .cse3)))) (and .cse1 .cse2 (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_#valid_BEFORE_CALL_56| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse7 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse9 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse5) 4))) (and (= .cse7 .cse0) (= (select |v_#valid_BEFORE_CALL_56| .cse5) 1) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse7 (select |v_#memory_$Pointer$#2.base_294| .cse7))) (= |c_#memory_$Pointer$#2.base| (store (store |v_#memory_$Pointer$#2.base_294| .cse0 .cse8) .cse5 (store (select |v_#memory_$Pointer$#2.base_294| .cse5) 8 (select .cse6 8)))) (= (select |v_#valid_BEFORE_CALL_56| .cse0) 0) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse9) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse5) (= |c_#valid| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse10 (select |c_#valid| .cse10)))) (= (select |v_#valid_BEFORE_CALL_56| .cse9) 1))))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))) is different from true [2024-11-28 04:58:20,562 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 327 treesize of output 311 [2024-11-28 04:58:20,653 INFO L349 Elim1Store]: treesize reduction 22, result has 51.1 percent of original size [2024-11-28 04:58:20,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 57 [2024-11-28 04:58:21,134 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (v_DerPreprocessor_44 Int) (v_prenex_56 Int) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (v_prenex_55 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse4 (store (store |v_#memory_$Pointer$#2.base_294| .cse2 v_DerPreprocessor_45) v_DerPreprocessor_44 v_DerPreprocessor_46))) (let ((.cse3 (select (select .cse4 .cse2) 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse5 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3) 4))) (and (= |v_#valid_BEFORE_CALL_57| (let ((.cse0 (@diff v_prenex_55 |v_#valid_BEFORE_CALL_57|))) (store v_prenex_55 .cse0 (select |v_#valid_BEFORE_CALL_57| .cse0)))) (= .cse1 .cse2) (= (store (select |v_#memory_$Pointer$#2.base_294| .cse3) 8 (select (select .cse4 .cse3) 8)) v_DerPreprocessor_46) (= v_DerPreprocessor_44 .cse3) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse1 (select |v_#memory_$Pointer$#2.base_294| .cse1))) (= (select v_prenex_55 .cse3) 1) (= .cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse5) (+ v_prenex_56 8))) (= (select v_prenex_55 .cse2) 0) (= (select v_prenex_55 .cse5) 1)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse2) 1)))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((v_arrayElimIndex_20 Int) (|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| v_arrayElimIndex_20) 1) (= (select |v_#valid_BEFORE_CALL_56| .cse6) 0) (= |v_#valid_BEFORE_CALL_57| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_56| |v_#valid_BEFORE_CALL_57|))) (store |v_#valid_BEFORE_CALL_56| .cse7 (select |v_#valid_BEFORE_CALL_57| .cse7)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse6) 1) (exists ((v_arrayElimIndex_21 Int)) (and (not (= .cse6 v_arrayElimIndex_21)) (= (select |v_#valid_BEFORE_CALL_57| v_arrayElimIndex_21) 1))))))))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-28 04:58:21,143 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (v_DerPreprocessor_44 Int) (v_prenex_56 Int) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (v_prenex_55 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse4 (store (store |v_#memory_$Pointer$#2.base_294| .cse2 v_DerPreprocessor_45) v_DerPreprocessor_44 v_DerPreprocessor_46))) (let ((.cse3 (select (select .cse4 .cse2) 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse5 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3) 4))) (and (= |v_#valid_BEFORE_CALL_57| (let ((.cse0 (@diff v_prenex_55 |v_#valid_BEFORE_CALL_57|))) (store v_prenex_55 .cse0 (select |v_#valid_BEFORE_CALL_57| .cse0)))) (= .cse1 .cse2) (= (store (select |v_#memory_$Pointer$#2.base_294| .cse3) 8 (select (select .cse4 .cse3) 8)) v_DerPreprocessor_46) (= v_DerPreprocessor_44 .cse3) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse1 (select |v_#memory_$Pointer$#2.base_294| .cse1))) (= (select v_prenex_55 .cse3) 1) (= .cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse5) (+ v_prenex_56 8))) (= (select v_prenex_55 .cse2) 0) (= (select v_prenex_55 .cse5) 1)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse2) 1)))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((v_arrayElimIndex_20 Int) (|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| v_arrayElimIndex_20) 1) (= (select |v_#valid_BEFORE_CALL_56| .cse6) 0) (= |v_#valid_BEFORE_CALL_57| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_56| |v_#valid_BEFORE_CALL_57|))) (store |v_#valid_BEFORE_CALL_56| .cse7 (select |v_#valid_BEFORE_CALL_57| .cse7)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse6) 1) (exists ((v_arrayElimIndex_21 Int)) (and (not (= .cse6 v_arrayElimIndex_21)) (= (select |v_#valid_BEFORE_CALL_57| v_arrayElimIndex_21) 1))))))))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-28 04:58:21,480 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (v_DerPreprocessor_44 Int) (v_prenex_56 Int) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (v_prenex_55 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse4 (store (store |v_#memory_$Pointer$#2.base_294| .cse2 v_DerPreprocessor_45) v_DerPreprocessor_44 v_DerPreprocessor_46))) (let ((.cse3 (select (select .cse4 .cse2) 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse5 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3) 4))) (and (= |v_#valid_BEFORE_CALL_57| (let ((.cse0 (@diff v_prenex_55 |v_#valid_BEFORE_CALL_57|))) (store v_prenex_55 .cse0 (select |v_#valid_BEFORE_CALL_57| .cse0)))) (= .cse1 .cse2) (= (store (select |v_#memory_$Pointer$#2.base_294| .cse3) 8 (select (select .cse4 .cse3) 8)) v_DerPreprocessor_46) (= v_DerPreprocessor_44 .cse3) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse1 (select |v_#memory_$Pointer$#2.base_294| .cse1))) (= (select v_prenex_55 .cse3) 1) (= .cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse5) (+ v_prenex_56 8))) (= (select v_prenex_55 .cse2) 0) (= (select v_prenex_55 .cse5) 1)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse2) 1)))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((v_arrayElimIndex_20 Int) (|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| v_arrayElimIndex_20) 1) (= (select |v_#valid_BEFORE_CALL_56| .cse6) 0) (= |v_#valid_BEFORE_CALL_57| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_56| |v_#valid_BEFORE_CALL_57|))) (store |v_#valid_BEFORE_CALL_56| .cse7 (select |v_#valid_BEFORE_CALL_57| .cse7)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse6) 1) (exists ((v_arrayElimIndex_21 Int)) (and (not (= .cse6 v_arrayElimIndex_21)) (= (select |v_#valid_BEFORE_CALL_57| v_arrayElimIndex_21) 1))))))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-28 04:58:21,492 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (v_DerPreprocessor_44 Int) (v_prenex_56 Int) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (v_prenex_55 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse4 (store (store |v_#memory_$Pointer$#2.base_294| .cse2 v_DerPreprocessor_45) v_DerPreprocessor_44 v_DerPreprocessor_46))) (let ((.cse3 (select (select .cse4 .cse2) 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse5 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3) 4))) (and (= |v_#valid_BEFORE_CALL_57| (let ((.cse0 (@diff v_prenex_55 |v_#valid_BEFORE_CALL_57|))) (store v_prenex_55 .cse0 (select |v_#valid_BEFORE_CALL_57| .cse0)))) (= .cse1 .cse2) (= (store (select |v_#memory_$Pointer$#2.base_294| .cse3) 8 (select (select .cse4 .cse3) 8)) v_DerPreprocessor_46) (= v_DerPreprocessor_44 .cse3) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse1 (select |v_#memory_$Pointer$#2.base_294| .cse1))) (= (select v_prenex_55 .cse3) 1) (= .cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse5) (+ v_prenex_56 8))) (= (select v_prenex_55 .cse2) 0) (= (select v_prenex_55 .cse5) 1)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse2) 1)))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((v_arrayElimIndex_20 Int) (|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| v_arrayElimIndex_20) 1) (= (select |v_#valid_BEFORE_CALL_56| .cse6) 0) (= |v_#valid_BEFORE_CALL_57| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_56| |v_#valid_BEFORE_CALL_57|))) (store |v_#valid_BEFORE_CALL_56| .cse7 (select |v_#valid_BEFORE_CALL_57| .cse7)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse6) 1) (exists ((v_arrayElimIndex_21 Int)) (and (not (= .cse6 v_arrayElimIndex_21)) (= (select |v_#valid_BEFORE_CALL_57| v_arrayElimIndex_21) 1))))))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-28 04:58:21,946 WARN L851 $PredicateComparison]: unable to prove that (and (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (v_DerPreprocessor_44 Int) (v_prenex_56 Int) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (v_prenex_55 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse4 (store (store |v_#memory_$Pointer$#2.base_294| .cse2 v_DerPreprocessor_45) v_DerPreprocessor_44 v_DerPreprocessor_46))) (let ((.cse3 (select (select .cse4 .cse2) 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse5 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3) 4))) (and (= |v_#valid_BEFORE_CALL_57| (let ((.cse0 (@diff v_prenex_55 |v_#valid_BEFORE_CALL_57|))) (store v_prenex_55 .cse0 (select |v_#valid_BEFORE_CALL_57| .cse0)))) (= .cse1 .cse2) (= (store (select |v_#memory_$Pointer$#2.base_294| .cse3) 8 (select (select .cse4 .cse3) 8)) v_DerPreprocessor_46) (= v_DerPreprocessor_44 .cse3) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse1 (select |v_#memory_$Pointer$#2.base_294| .cse1))) (= (select v_prenex_55 .cse3) 1) (= .cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse5) (+ v_prenex_56 8))) (= (select v_prenex_55 .cse2) 0) (= (select v_prenex_55 .cse5) 1)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse2) 1)))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((v_arrayElimIndex_20 Int) (|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| v_arrayElimIndex_20) 1) (= (select |v_#valid_BEFORE_CALL_56| .cse6) 0) (= |v_#valid_BEFORE_CALL_57| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_56| |v_#valid_BEFORE_CALL_57|))) (store |v_#valid_BEFORE_CALL_56| .cse7 (select |v_#valid_BEFORE_CALL_57| .cse7)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse6) 1) (exists ((v_arrayElimIndex_21 Int)) (and (not (= .cse6 v_arrayElimIndex_21)) (= (select |v_#valid_BEFORE_CALL_57| v_arrayElimIndex_21) 1))))))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-28 04:58:21,955 WARN L873 $PredicateComparison]: unable to prove that (and (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (v_DerPreprocessor_44 Int) (v_prenex_56 Int) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (v_prenex_55 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse4 (store (store |v_#memory_$Pointer$#2.base_294| .cse2 v_DerPreprocessor_45) v_DerPreprocessor_44 v_DerPreprocessor_46))) (let ((.cse3 (select (select .cse4 .cse2) 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse5 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3) 4))) (and (= |v_#valid_BEFORE_CALL_57| (let ((.cse0 (@diff v_prenex_55 |v_#valid_BEFORE_CALL_57|))) (store v_prenex_55 .cse0 (select |v_#valid_BEFORE_CALL_57| .cse0)))) (= .cse1 .cse2) (= (store (select |v_#memory_$Pointer$#2.base_294| .cse3) 8 (select (select .cse4 .cse3) 8)) v_DerPreprocessor_46) (= v_DerPreprocessor_44 .cse3) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse1 (select |v_#memory_$Pointer$#2.base_294| .cse1))) (= (select v_prenex_55 .cse3) 1) (= .cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse5) (+ v_prenex_56 8))) (= (select v_prenex_55 .cse2) 0) (= (select v_prenex_55 .cse5) 1)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse2) 1)))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((v_arrayElimIndex_20 Int) (|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| v_arrayElimIndex_20) 1) (= (select |v_#valid_BEFORE_CALL_56| .cse6) 0) (= |v_#valid_BEFORE_CALL_57| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_56| |v_#valid_BEFORE_CALL_57|))) (store |v_#valid_BEFORE_CALL_56| .cse7 (select |v_#valid_BEFORE_CALL_57| .cse7)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse6) 1) (exists ((v_arrayElimIndex_21 Int)) (and (not (= .cse6 v_arrayElimIndex_21)) (= (select |v_#valid_BEFORE_CALL_57| v_arrayElimIndex_21) 1))))))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-28 04:58:22,520 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (v_DerPreprocessor_44 Int) (v_prenex_56 Int) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (v_prenex_55 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse4 (store (store |v_#memory_$Pointer$#2.base_294| .cse2 v_DerPreprocessor_45) v_DerPreprocessor_44 v_DerPreprocessor_46))) (let ((.cse3 (select (select .cse4 .cse2) 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse5 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3) 4))) (and (= |v_#valid_BEFORE_CALL_57| (let ((.cse0 (@diff v_prenex_55 |v_#valid_BEFORE_CALL_57|))) (store v_prenex_55 .cse0 (select |v_#valid_BEFORE_CALL_57| .cse0)))) (= .cse1 .cse2) (= (store (select |v_#memory_$Pointer$#2.base_294| .cse3) 8 (select (select .cse4 .cse3) 8)) v_DerPreprocessor_46) (= v_DerPreprocessor_44 .cse3) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse1 (select |v_#memory_$Pointer$#2.base_294| .cse1))) (= (select v_prenex_55 .cse3) 1) (= .cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse5) (+ v_prenex_56 8))) (= (select v_prenex_55 .cse2) 0) (= (select v_prenex_55 .cse5) 1)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse2) 1)))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((v_arrayElimIndex_20 Int) (|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| v_arrayElimIndex_20) 1) (= (select |v_#valid_BEFORE_CALL_56| .cse6) 0) (= |v_#valid_BEFORE_CALL_57| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_56| |v_#valid_BEFORE_CALL_57|))) (store |v_#valid_BEFORE_CALL_56| .cse7 (select |v_#valid_BEFORE_CALL_57| .cse7)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse6) 1) (exists ((v_arrayElimIndex_21 Int)) (and (not (= .cse6 v_arrayElimIndex_21)) (= (select |v_#valid_BEFORE_CALL_57| v_arrayElimIndex_21) 1)))))))))) is different from false [2024-11-28 04:58:22,532 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (v_DerPreprocessor_44 Int) (v_prenex_56 Int) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (v_prenex_55 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse4 (store (store |v_#memory_$Pointer$#2.base_294| .cse2 v_DerPreprocessor_45) v_DerPreprocessor_44 v_DerPreprocessor_46))) (let ((.cse3 (select (select .cse4 .cse2) 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse5 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3) 4))) (and (= |v_#valid_BEFORE_CALL_57| (let ((.cse0 (@diff v_prenex_55 |v_#valid_BEFORE_CALL_57|))) (store v_prenex_55 .cse0 (select |v_#valid_BEFORE_CALL_57| .cse0)))) (= .cse1 .cse2) (= (store (select |v_#memory_$Pointer$#2.base_294| .cse3) 8 (select (select .cse4 .cse3) 8)) v_DerPreprocessor_46) (= v_DerPreprocessor_44 .cse3) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse1 (select |v_#memory_$Pointer$#2.base_294| .cse1))) (= (select v_prenex_55 .cse3) 1) (= .cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse5) (+ v_prenex_56 8))) (= (select v_prenex_55 .cse2) 0) (= (select v_prenex_55 .cse5) 1)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse2) 1)))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((v_arrayElimIndex_20 Int) (|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| v_arrayElimIndex_20) 1) (= (select |v_#valid_BEFORE_CALL_56| .cse6) 0) (= |v_#valid_BEFORE_CALL_57| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_56| |v_#valid_BEFORE_CALL_57|))) (store |v_#valid_BEFORE_CALL_56| .cse7 (select |v_#valid_BEFORE_CALL_57| .cse7)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse6) 1) (exists ((v_arrayElimIndex_21 Int)) (and (not (= .cse6 v_arrayElimIndex_21)) (= (select |v_#valid_BEFORE_CALL_57| v_arrayElimIndex_21) 1)))))))))) is different from true [2024-11-28 04:58:23,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:58:23,133 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 336 treesize of output 325 [2024-11-28 04:58:23,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:58:23,670 INFO L349 Elim1Store]: treesize reduction 64, result has 14.7 percent of original size [2024-11-28 04:58:23,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 119 treesize of output 82 [2024-11-28 04:58:25,137 WARN L851 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) 0) 0) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (v_DerPreprocessor_44 Int) (v_prenex_56 Int) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (v_prenex_55 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse4 (store (store |v_#memory_$Pointer$#2.base_294| .cse2 v_DerPreprocessor_45) v_DerPreprocessor_44 v_DerPreprocessor_46))) (let ((.cse3 (select (select .cse4 .cse2) 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse5 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3) 4))) (and (= |v_#valid_BEFORE_CALL_57| (let ((.cse0 (@diff v_prenex_55 |v_#valid_BEFORE_CALL_57|))) (store v_prenex_55 .cse0 (select |v_#valid_BEFORE_CALL_57| .cse0)))) (= .cse1 .cse2) (= (store (select |v_#memory_$Pointer$#2.base_294| .cse3) 8 (select (select .cse4 .cse3) 8)) v_DerPreprocessor_46) (= v_DerPreprocessor_44 .cse3) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse1 (select |v_#memory_$Pointer$#2.base_294| .cse1))) (= (select v_prenex_55 .cse3) 1) (= .cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse5) (+ v_prenex_56 8))) (= (select v_prenex_55 .cse2) 0) (= (select v_prenex_55 .cse5) 1)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse2) 1)))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((v_arrayElimIndex_20 Int) (|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| v_arrayElimIndex_20) 1) (= (select |v_#valid_BEFORE_CALL_56| .cse6) 0) (= |v_#valid_BEFORE_CALL_57| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_56| |v_#valid_BEFORE_CALL_57|))) (store |v_#valid_BEFORE_CALL_56| .cse7 (select |v_#valid_BEFORE_CALL_57| .cse7)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse6) 1) (exists ((v_arrayElimIndex_21 Int)) (and (not (= .cse6 v_arrayElimIndex_21)) (= (select |v_#valid_BEFORE_CALL_57| v_arrayElimIndex_21) 1))))))))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) 0))) (let ((.cse8 (= (select (select |c_#memory_$Pointer$#2.offset| .cse10) 4) 0)) (.cse13 (select |c_#memory_$Pointer$#2.base| .cse10))) (or (let ((.cse9 (select .cse13 4))) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| .cse9) 4))) (and (or .cse8 (= .cse9 .cse10)) (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (v_prenex_61 (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_61| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= (select v_prenex_61 .cse10) 0) (= (select |v_old(#valid)_AFTER_CALL_61| .cse10) 1) (= (select v_prenex_61 .cse11) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1)) (= (let ((.cse12 (@diff v_prenex_61 |v_old(#valid)_AFTER_CALL_61|))) (store v_prenex_61 .cse12 (select |v_old(#valid)_AFTER_CALL_61| .cse12))) |v_old(#valid)_AFTER_CALL_61|))) (or (exists ((v_prenex_62 Int)) (= .cse9 (select (select |c_#memory_$Pointer$#2.base| .cse11) (+ v_prenex_62 8)))) (= .cse9 .cse11))))) (and .cse8 (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (|node_create_~temp~0#1.base| Int) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_#valid_BEFORE_CALL_56| (Array Int Int)) (v_DerPreprocessor_51 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse18 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_51))) (let ((.cse17 (store (store |v_#memory_$Pointer$#2.base_294| .cse10 .cse13) v_DerPreprocessor_51 .cse18))) (let ((.cse14 (select (select .cse17 .cse10) 4))) (let ((.cse15 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse16 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse14) 4))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse14) 1) (= v_DerPreprocessor_51 .cse14) (= .cse15 .cse10) (= .cse14 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse16) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8))) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse15 (select |v_#memory_$Pointer$#2.base_294| .cse15))) (= |c_#memory_$Pointer$#2.base| (store .cse17 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|))) (= (select |v_#valid_BEFORE_CALL_56| .cse10) 0) (= (store (select |v_#memory_$Pointer$#2.base_294| .cse14) 8 (select (select .cse17 .cse14) 8)) .cse18) (= (select |v_#valid_BEFORE_CALL_56| .cse16) 1) (= (select |v_old(#valid)_AFTER_CALL_61| .cse10) 1) (= (let ((.cse19 (@diff |v_#valid_BEFORE_CALL_56| |v_old(#valid)_AFTER_CALL_61|))) (store |v_#valid_BEFORE_CALL_56| .cse19 (select |v_old(#valid)_AFTER_CALL_61| .cse19))) |v_old(#valid)_AFTER_CALL_61|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1)))))))))))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)) is different from false [2024-11-28 04:58:25,149 WARN L873 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) 0) 0) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (v_DerPreprocessor_44 Int) (v_prenex_56 Int) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (v_prenex_55 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse4 (store (store |v_#memory_$Pointer$#2.base_294| .cse2 v_DerPreprocessor_45) v_DerPreprocessor_44 v_DerPreprocessor_46))) (let ((.cse3 (select (select .cse4 .cse2) 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse5 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3) 4))) (and (= |v_#valid_BEFORE_CALL_57| (let ((.cse0 (@diff v_prenex_55 |v_#valid_BEFORE_CALL_57|))) (store v_prenex_55 .cse0 (select |v_#valid_BEFORE_CALL_57| .cse0)))) (= .cse1 .cse2) (= (store (select |v_#memory_$Pointer$#2.base_294| .cse3) 8 (select (select .cse4 .cse3) 8)) v_DerPreprocessor_46) (= v_DerPreprocessor_44 .cse3) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse1 (select |v_#memory_$Pointer$#2.base_294| .cse1))) (= (select v_prenex_55 .cse3) 1) (= .cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse5) (+ v_prenex_56 8))) (= (select v_prenex_55 .cse2) 0) (= (select v_prenex_55 .cse5) 1)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse2) 1)))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((v_arrayElimIndex_20 Int) (|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| v_arrayElimIndex_20) 1) (= (select |v_#valid_BEFORE_CALL_56| .cse6) 0) (= |v_#valid_BEFORE_CALL_57| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_56| |v_#valid_BEFORE_CALL_57|))) (store |v_#valid_BEFORE_CALL_56| .cse7 (select |v_#valid_BEFORE_CALL_57| .cse7)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse6) 1) (exists ((v_arrayElimIndex_21 Int)) (and (not (= .cse6 v_arrayElimIndex_21)) (= (select |v_#valid_BEFORE_CALL_57| v_arrayElimIndex_21) 1))))))))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) 0))) (let ((.cse8 (= (select (select |c_#memory_$Pointer$#2.offset| .cse10) 4) 0)) (.cse13 (select |c_#memory_$Pointer$#2.base| .cse10))) (or (let ((.cse9 (select .cse13 4))) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| .cse9) 4))) (and (or .cse8 (= .cse9 .cse10)) (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (v_prenex_61 (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_61| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= (select v_prenex_61 .cse10) 0) (= (select |v_old(#valid)_AFTER_CALL_61| .cse10) 1) (= (select v_prenex_61 .cse11) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1)) (= (let ((.cse12 (@diff v_prenex_61 |v_old(#valid)_AFTER_CALL_61|))) (store v_prenex_61 .cse12 (select |v_old(#valid)_AFTER_CALL_61| .cse12))) |v_old(#valid)_AFTER_CALL_61|))) (or (exists ((v_prenex_62 Int)) (= .cse9 (select (select |c_#memory_$Pointer$#2.base| .cse11) (+ v_prenex_62 8)))) (= .cse9 .cse11))))) (and .cse8 (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (|node_create_~temp~0#1.base| Int) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_#valid_BEFORE_CALL_56| (Array Int Int)) (v_DerPreprocessor_51 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse18 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_51))) (let ((.cse17 (store (store |v_#memory_$Pointer$#2.base_294| .cse10 .cse13) v_DerPreprocessor_51 .cse18))) (let ((.cse14 (select (select .cse17 .cse10) 4))) (let ((.cse15 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse16 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse14) 4))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse14) 1) (= v_DerPreprocessor_51 .cse14) (= .cse15 .cse10) (= .cse14 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse16) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8))) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse15 (select |v_#memory_$Pointer$#2.base_294| .cse15))) (= |c_#memory_$Pointer$#2.base| (store .cse17 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|))) (= (select |v_#valid_BEFORE_CALL_56| .cse10) 0) (= (store (select |v_#memory_$Pointer$#2.base_294| .cse14) 8 (select (select .cse17 .cse14) 8)) .cse18) (= (select |v_#valid_BEFORE_CALL_56| .cse16) 1) (= (select |v_old(#valid)_AFTER_CALL_61| .cse10) 1) (= (let ((.cse19 (@diff |v_#valid_BEFORE_CALL_56| |v_old(#valid)_AFTER_CALL_61|))) (store |v_#valid_BEFORE_CALL_56| .cse19 (select |v_old(#valid)_AFTER_CALL_61| .cse19))) |v_old(#valid)_AFTER_CALL_61|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1)))))))))))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)) is different from true [2024-11-28 04:58:26,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:58:26,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 799 treesize of output 575 [2024-11-28 04:58:26,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:58:26,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 218 treesize of output 230 [2024-11-28 04:58:29,448 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 0) (let ((.cse7 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 4) 0)) (.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (v_prenex_70 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_69 (Array Int (Array Int Int))) (v_prenex_68 (Array Int (Array Int Int))) (v_DerPreprocessor_51 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_51))) (let ((.cse1 (store (store v_prenex_68 |c_ULTIMATE.start_dll_append_#t~mem9#1.base| .cse6) v_DerPreprocessor_51 .cse2))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 4))) (let ((.cse3 (@diff v_prenex_69 v_prenex_68)) (.cse5 (select (select v_prenex_69 .cse0) 4))) (and (= (store (select v_prenex_68 .cse0) 8 (select (select .cse1 .cse0) 8)) .cse2) (= (store v_prenex_69 .cse3 (select v_prenex_68 .cse3)) v_prenex_68) (= (let ((.cse4 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_61|))) (store v_prenex_70 .cse4 (select |v_old(#valid)_AFTER_CALL_61| .cse4))) |v_old(#valid)_AFTER_CALL_61|) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= (select v_prenex_70 .cse0) 1) (= .cse3 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (= |c_#memory_$Pointer$#2.base| (store .cse1 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|))) (= (select v_prenex_70 .cse5) 1) (= .cse0 v_DerPreprocessor_51) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1)) (= (select v_prenex_70 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 0) (= .cse0 (select (select v_prenex_69 .cse5) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8))) (= (select |v_old(#valid)_AFTER_CALL_61| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 1))))))) .cse7) (let ((.cse8 (select .cse6 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| .cse8) 4))) (and (or (= .cse8 .cse9) (exists ((v_prenex_62 Int)) (= .cse8 (select (select |c_#memory_$Pointer$#2.base| .cse9) (+ v_prenex_62 8))))) (or (= .cse8 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse7) (exists ((v_prenex_61 (Array Int Int)) (v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (= (select v_prenex_61 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 0) (= (select v_prenex_66 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 1) (= (select v_prenex_66 .cse8) 1) (= v_prenex_66 (let ((.cse10 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse10 (select v_prenex_66 .cse10)))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_61 .cse9) 1) (= (select v_prenex_66 v_prenex_67) 0))))))))) is different from false [2024-11-28 04:58:29,457 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 0) (let ((.cse7 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 4) 0)) (.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (v_prenex_70 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_69 (Array Int (Array Int Int))) (v_prenex_68 (Array Int (Array Int Int))) (v_DerPreprocessor_51 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_51))) (let ((.cse1 (store (store v_prenex_68 |c_ULTIMATE.start_dll_append_#t~mem9#1.base| .cse6) v_DerPreprocessor_51 .cse2))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 4))) (let ((.cse3 (@diff v_prenex_69 v_prenex_68)) (.cse5 (select (select v_prenex_69 .cse0) 4))) (and (= (store (select v_prenex_68 .cse0) 8 (select (select .cse1 .cse0) 8)) .cse2) (= (store v_prenex_69 .cse3 (select v_prenex_68 .cse3)) v_prenex_68) (= (let ((.cse4 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_61|))) (store v_prenex_70 .cse4 (select |v_old(#valid)_AFTER_CALL_61| .cse4))) |v_old(#valid)_AFTER_CALL_61|) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= (select v_prenex_70 .cse0) 1) (= .cse3 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (= |c_#memory_$Pointer$#2.base| (store .cse1 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|))) (= (select v_prenex_70 .cse5) 1) (= .cse0 v_DerPreprocessor_51) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1)) (= (select v_prenex_70 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 0) (= .cse0 (select (select v_prenex_69 .cse5) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8))) (= (select |v_old(#valid)_AFTER_CALL_61| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 1))))))) .cse7) (let ((.cse8 (select .cse6 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| .cse8) 4))) (and (or (= .cse8 .cse9) (exists ((v_prenex_62 Int)) (= .cse8 (select (select |c_#memory_$Pointer$#2.base| .cse9) (+ v_prenex_62 8))))) (or (= .cse8 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse7) (exists ((v_prenex_61 (Array Int Int)) (v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (= (select v_prenex_61 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 0) (= (select v_prenex_66 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 1) (= (select v_prenex_66 .cse8) 1) (= v_prenex_66 (let ((.cse10 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse10 (select v_prenex_66 .cse10)))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_61 .cse9) 1) (= (select v_prenex_66 v_prenex_67) 0))))))))) is different from true [2024-11-28 04:58:29,733 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (let ((.cse7 (= 0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (v_prenex_70 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_69 (Array Int (Array Int Int))) (v_prenex_68 (Array Int (Array Int Int))) (v_DerPreprocessor_51 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_51))) (let ((.cse2 (store (store v_prenex_68 |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6) v_DerPreprocessor_51 .cse0))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse3 (@diff v_prenex_69 v_prenex_68)) (.cse5 (select (select v_prenex_69 .cse1) 4))) (and (= .cse0 (store (select v_prenex_68 .cse1) 8 (select (select .cse2 .cse1) 8))) (= (store v_prenex_69 .cse3 (select v_prenex_68 .cse3)) v_prenex_68) (= (let ((.cse4 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_61|))) (store v_prenex_70 .cse4 (select |v_old(#valid)_AFTER_CALL_61| .cse4))) |v_old(#valid)_AFTER_CALL_61|) (= (select v_prenex_70 .cse1) 1) (= (select v_prenex_70 .cse5) 1) (= 0 (select v_prenex_70 |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (= v_DerPreprocessor_51 .cse1) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3) (= (select |v_old(#valid)_AFTER_CALL_61| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (select (select v_prenex_69 .cse5) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse1) (= (store .cse2 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1)))))))) .cse7) (let ((.cse8 (select .cse6 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| .cse8) 4))) (and (or (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse8) .cse7) (exists ((v_prenex_61 (Array Int Int)) (v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (= (select v_prenex_66 .cse8) 1) (= (select v_prenex_61 .cse9) 1) (= (select v_prenex_61 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= v_prenex_66 (let ((.cse10 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse10 (select v_prenex_66 .cse10)))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_66 v_prenex_67) 0) (= (select v_prenex_66 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1))) (or (= .cse9 .cse8) (exists ((v_prenex_62 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse9) (+ v_prenex_62 8)) .cse8))))))))) is different from false [2024-11-28 04:58:29,742 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (let ((.cse7 (= 0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (v_prenex_70 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_69 (Array Int (Array Int Int))) (v_prenex_68 (Array Int (Array Int Int))) (v_DerPreprocessor_51 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_51))) (let ((.cse2 (store (store v_prenex_68 |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6) v_DerPreprocessor_51 .cse0))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse3 (@diff v_prenex_69 v_prenex_68)) (.cse5 (select (select v_prenex_69 .cse1) 4))) (and (= .cse0 (store (select v_prenex_68 .cse1) 8 (select (select .cse2 .cse1) 8))) (= (store v_prenex_69 .cse3 (select v_prenex_68 .cse3)) v_prenex_68) (= (let ((.cse4 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_61|))) (store v_prenex_70 .cse4 (select |v_old(#valid)_AFTER_CALL_61| .cse4))) |v_old(#valid)_AFTER_CALL_61|) (= (select v_prenex_70 .cse1) 1) (= (select v_prenex_70 .cse5) 1) (= 0 (select v_prenex_70 |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (= v_DerPreprocessor_51 .cse1) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3) (= (select |v_old(#valid)_AFTER_CALL_61| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (select (select v_prenex_69 .cse5) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse1) (= (store .cse2 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1)))))))) .cse7) (let ((.cse8 (select .cse6 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| .cse8) 4))) (and (or (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse8) .cse7) (exists ((v_prenex_61 (Array Int Int)) (v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (= (select v_prenex_66 .cse8) 1) (= (select v_prenex_61 .cse9) 1) (= (select v_prenex_61 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= v_prenex_66 (let ((.cse10 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse10 (select v_prenex_66 .cse10)))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_66 v_prenex_67) 0) (= (select v_prenex_66 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1))) (or (= .cse9 .cse8) (exists ((v_prenex_62 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse9) (+ v_prenex_62 8)) .cse8))))))))) is different from true [2024-11-28 04:58:30,023 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (let ((.cse7 (= 0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (v_prenex_70 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_69 (Array Int (Array Int Int))) (v_prenex_68 (Array Int (Array Int Int))) (v_DerPreprocessor_51 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_51))) (let ((.cse2 (store (store v_prenex_68 |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6) v_DerPreprocessor_51 .cse0))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse3 (@diff v_prenex_69 v_prenex_68)) (.cse5 (select (select v_prenex_69 .cse1) 4))) (and (= .cse0 (store (select v_prenex_68 .cse1) 8 (select (select .cse2 .cse1) 8))) (= (store v_prenex_69 .cse3 (select v_prenex_68 .cse3)) v_prenex_68) (= (let ((.cse4 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_61|))) (store v_prenex_70 .cse4 (select |v_old(#valid)_AFTER_CALL_61| .cse4))) |v_old(#valid)_AFTER_CALL_61|) (= (select v_prenex_70 .cse1) 1) (= (select v_prenex_70 .cse5) 1) (= 0 (select v_prenex_70 |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (= v_DerPreprocessor_51 .cse1) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3) (= (select |v_old(#valid)_AFTER_CALL_61| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (select (select v_prenex_69 .cse5) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse1) (= (store .cse2 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1)))))))) .cse7) (let ((.cse8 (select .cse6 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| .cse8) 4))) (and (or (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse8) .cse7) (exists ((v_prenex_61 (Array Int Int)) (v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (= (select v_prenex_66 .cse8) 1) (= (select v_prenex_61 .cse9) 1) (= (select v_prenex_61 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= v_prenex_66 (let ((.cse10 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse10 (select v_prenex_66 .cse10)))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_66 v_prenex_67) 0) (= (select v_prenex_66 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1))) (or (= .cse9 .cse8) (exists ((v_prenex_62 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse9) (+ v_prenex_62 8)) .cse8))))))))) is different from false [2024-11-28 04:58:30,031 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (let ((.cse7 (= 0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (v_prenex_70 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_69 (Array Int (Array Int Int))) (v_prenex_68 (Array Int (Array Int Int))) (v_DerPreprocessor_51 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_51))) (let ((.cse2 (store (store v_prenex_68 |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6) v_DerPreprocessor_51 .cse0))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse3 (@diff v_prenex_69 v_prenex_68)) (.cse5 (select (select v_prenex_69 .cse1) 4))) (and (= .cse0 (store (select v_prenex_68 .cse1) 8 (select (select .cse2 .cse1) 8))) (= (store v_prenex_69 .cse3 (select v_prenex_68 .cse3)) v_prenex_68) (= (let ((.cse4 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_61|))) (store v_prenex_70 .cse4 (select |v_old(#valid)_AFTER_CALL_61| .cse4))) |v_old(#valid)_AFTER_CALL_61|) (= (select v_prenex_70 .cse1) 1) (= (select v_prenex_70 .cse5) 1) (= 0 (select v_prenex_70 |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (= v_DerPreprocessor_51 .cse1) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3) (= (select |v_old(#valid)_AFTER_CALL_61| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (select (select v_prenex_69 .cse5) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse1) (= (store .cse2 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1)))))))) .cse7) (let ((.cse8 (select .cse6 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| .cse8) 4))) (and (or (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse8) .cse7) (exists ((v_prenex_61 (Array Int Int)) (v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (= (select v_prenex_66 .cse8) 1) (= (select v_prenex_61 .cse9) 1) (= (select v_prenex_61 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= v_prenex_66 (let ((.cse10 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse10 (select v_prenex_66 .cse10)))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_66 v_prenex_67) 0) (= (select v_prenex_66 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1))) (or (= .cse9 .cse8) (exists ((v_prenex_62 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse9) (+ v_prenex_62 8)) .cse8))))))))) is different from true [2024-11-28 04:58:30,328 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 345 treesize of output 333 [2024-11-28 04:58:31,121 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_dll_append_#t~mem11#1.offset| 0))) (or (and (or (exists ((v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_66 v_prenex_67) 0) (exists ((v_prenex_61 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_63| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= .cse0 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= (select v_prenex_66 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 1) (exists ((v_prenex_62 Int)) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) (+ v_prenex_62 8)))) (= (select v_prenex_66 .cse0) 1) (= (select v_prenex_61 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 0) (= (select v_prenex_61 .cse1) 1))))) (= v_prenex_66 (let ((.cse2 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse2 (select v_prenex_66 .cse2)))))))) (exists ((v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (exists ((v_prenex_61 (Array Int Int))) (and (= v_prenex_66 (let ((.cse3 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse3 (select v_prenex_66 .cse3)))) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_63| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4))) (and (= .cse4 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= (select v_prenex_66 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 1) (= (select v_prenex_61 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 0) (= .cse4 .cse5) (= (select v_prenex_61 .cse5) 1))))))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_66 v_prenex_67) 0)))) .cse6) (and (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (v_prenex_70 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_69 (Array Int (Array Int Int))) (v_prenex_68 (Array Int (Array Int Int))) (v_DerPreprocessor_51 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse10 (@diff v_prenex_69 v_prenex_68))) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| .cse10)) (.cse9 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_51))) (let ((.cse8 (store (store v_prenex_68 .cse10 .cse13) v_DerPreprocessor_51 .cse9))) (let ((.cse7 (select (select .cse8 .cse10) 4))) (let ((.cse12 (select (select v_prenex_69 .cse7) 4))) (and (= (store (select v_prenex_68 .cse7) 8 (select (select .cse8 .cse7) 8)) .cse9) (= (store .cse8 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (select v_prenex_70 .cse7) 1) (= (store v_prenex_69 .cse10 (select v_prenex_68 .cse10)) v_prenex_68) (= (let ((.cse11 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_61|))) (store v_prenex_70 .cse11 (select |v_old(#valid)_AFTER_CALL_61| .cse11))) |v_old(#valid)_AFTER_CALL_61|) (= (select v_prenex_70 .cse10) 0) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_61| .cse10) 1) (= (select (select v_prenex_69 .cse12) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse7) (= (select .cse13 4) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= v_DerPreprocessor_51 .cse7) (= (select v_prenex_70 .cse12) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1))))))))) .cse6))) is different from false [2024-11-28 04:58:31,130 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_dll_append_#t~mem11#1.offset| 0))) (or (and (or (exists ((v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_66 v_prenex_67) 0) (exists ((v_prenex_61 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_63| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= .cse0 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= (select v_prenex_66 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 1) (exists ((v_prenex_62 Int)) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) (+ v_prenex_62 8)))) (= (select v_prenex_66 .cse0) 1) (= (select v_prenex_61 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 0) (= (select v_prenex_61 .cse1) 1))))) (= v_prenex_66 (let ((.cse2 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse2 (select v_prenex_66 .cse2)))))))) (exists ((v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (exists ((v_prenex_61 (Array Int Int))) (and (= v_prenex_66 (let ((.cse3 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse3 (select v_prenex_66 .cse3)))) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_63| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4))) (and (= .cse4 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= (select v_prenex_66 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 1) (= (select v_prenex_61 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 0) (= .cse4 .cse5) (= (select v_prenex_61 .cse5) 1))))))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_66 v_prenex_67) 0)))) .cse6) (and (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (v_prenex_70 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_69 (Array Int (Array Int Int))) (v_prenex_68 (Array Int (Array Int Int))) (v_DerPreprocessor_51 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse10 (@diff v_prenex_69 v_prenex_68))) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| .cse10)) (.cse9 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_51))) (let ((.cse8 (store (store v_prenex_68 .cse10 .cse13) v_DerPreprocessor_51 .cse9))) (let ((.cse7 (select (select .cse8 .cse10) 4))) (let ((.cse12 (select (select v_prenex_69 .cse7) 4))) (and (= (store (select v_prenex_68 .cse7) 8 (select (select .cse8 .cse7) 8)) .cse9) (= (store .cse8 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (select v_prenex_70 .cse7) 1) (= (store v_prenex_69 .cse10 (select v_prenex_68 .cse10)) v_prenex_68) (= (let ((.cse11 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_61|))) (store v_prenex_70 .cse11 (select |v_old(#valid)_AFTER_CALL_61| .cse11))) |v_old(#valid)_AFTER_CALL_61|) (= (select v_prenex_70 .cse10) 0) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_61| .cse10) 1) (= (select (select v_prenex_69 .cse12) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse7) (= (select .cse13 4) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= v_DerPreprocessor_51 .cse7) (= (select v_prenex_70 .cse12) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1))))))))) .cse6))) is different from true [2024-11-28 04:58:31,543 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0))) (or (and .cse0 (or (exists ((v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (exists ((v_prenex_61 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_63| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select v_prenex_66 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 1) (exists ((v_prenex_62 Int)) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) (+ v_prenex_62 8)))) (= (select v_prenex_66 .cse1) 1) (= .cse1 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select v_prenex_61 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 0) (= (select v_prenex_61 .cse2) 1))))) (= v_prenex_66 (let ((.cse3 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse3 (select v_prenex_66 .cse3)))))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_66 v_prenex_67) 0))) (exists ((v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (exists ((v_prenex_61 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_63| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4))) (and (= (select v_prenex_66 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 1) (= .cse4 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select v_prenex_61 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 0) (= .cse4 .cse5) (= (select v_prenex_61 .cse5) 1))))) (= v_prenex_66 (let ((.cse6 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse6 (select v_prenex_66 .cse6)))))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_66 v_prenex_67) 0))))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (v_prenex_70 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_69 (Array Int (Array Int Int))) (v_prenex_68 (Array Int (Array Int Int))) (v_DerPreprocessor_51 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse10 (@diff v_prenex_69 v_prenex_68))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse10)) (.cse9 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_51))) (let ((.cse8 (store (store v_prenex_68 .cse10 .cse12) v_DerPreprocessor_51 .cse9))) (let ((.cse7 (select (select .cse8 .cse10) 4))) (let ((.cse13 (select (select v_prenex_69 .cse7) 4))) (and (= (store (select v_prenex_68 .cse7) 8 (select (select .cse8 .cse7) 8)) .cse9) (= (store .cse8 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (select v_prenex_70 .cse7) 1) (= (store v_prenex_69 .cse10 (select v_prenex_68 .cse10)) v_prenex_68) (= (let ((.cse11 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_61|))) (store v_prenex_70 .cse11 (select |v_old(#valid)_AFTER_CALL_61| .cse11))) |v_old(#valid)_AFTER_CALL_61|) (= (select .cse12 4) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select v_prenex_70 .cse10) 0) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_61| .cse10) 1) (= (select (select v_prenex_69 .cse13) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse7) (= v_DerPreprocessor_51 .cse7) (= (select v_prenex_70 .cse13) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1)))))))))))) is different from false [2024-11-28 04:58:31,553 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0))) (or (and .cse0 (or (exists ((v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (exists ((v_prenex_61 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_63| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select v_prenex_66 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 1) (exists ((v_prenex_62 Int)) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) (+ v_prenex_62 8)))) (= (select v_prenex_66 .cse1) 1) (= .cse1 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select v_prenex_61 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 0) (= (select v_prenex_61 .cse2) 1))))) (= v_prenex_66 (let ((.cse3 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse3 (select v_prenex_66 .cse3)))))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_66 v_prenex_67) 0))) (exists ((v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (exists ((v_prenex_61 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_63| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4))) (and (= (select v_prenex_66 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 1) (= .cse4 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select v_prenex_61 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 0) (= .cse4 .cse5) (= (select v_prenex_61 .cse5) 1))))) (= v_prenex_66 (let ((.cse6 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse6 (select v_prenex_66 .cse6)))))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_66 v_prenex_67) 0))))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (v_prenex_70 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_69 (Array Int (Array Int Int))) (v_prenex_68 (Array Int (Array Int Int))) (v_DerPreprocessor_51 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse10 (@diff v_prenex_69 v_prenex_68))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse10)) (.cse9 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_51))) (let ((.cse8 (store (store v_prenex_68 .cse10 .cse12) v_DerPreprocessor_51 .cse9))) (let ((.cse7 (select (select .cse8 .cse10) 4))) (let ((.cse13 (select (select v_prenex_69 .cse7) 4))) (and (= (store (select v_prenex_68 .cse7) 8 (select (select .cse8 .cse7) 8)) .cse9) (= (store .cse8 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (select v_prenex_70 .cse7) 1) (= (store v_prenex_69 .cse10 (select v_prenex_68 .cse10)) v_prenex_68) (= (let ((.cse11 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_61|))) (store v_prenex_70 .cse11 (select |v_old(#valid)_AFTER_CALL_61| .cse11))) |v_old(#valid)_AFTER_CALL_61|) (= (select .cse12 4) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select v_prenex_70 .cse10) 0) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_61| .cse10) 1) (= (select (select v_prenex_69 .cse13) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse7) (= v_DerPreprocessor_51 .cse7) (= (select v_prenex_70 .cse13) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1)))))))))))) is different from true [2024-11-28 04:58:32,541 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 04:58:32,542 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 15 [2024-11-28 04:58:32,777 INFO L349 Elim1Store]: treesize reduction 33, result has 10.8 percent of original size [2024-11-28 04:58:32,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 27 [2024-11-28 04:58:32,976 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (v_prenex_70 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_69 (Array Int (Array Int Int))) (v_prenex_68 (Array Int (Array Int Int))) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int)) (v_DerPreprocessor_51 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse0 (@diff v_prenex_69 v_prenex_68))) (let ((.cse4 (store (store (store v_prenex_68 .cse0 v_DerPreprocessor_54) v_DerPreprocessor_51 v_DerPreprocessor_55) |node_create_~temp~0#1.base| v_DerPreprocessor_56))) (let ((.cse5 (select .cse4 .cse0)) (.cse7 (select .cse4 v_DerPreprocessor_51))) (let ((.cse6 (store (store v_prenex_68 .cse0 .cse5) v_DerPreprocessor_51 .cse7))) (let ((.cse2 (select (select .cse6 .cse0) 4))) (let ((.cse3 (select (select v_prenex_69 .cse2) 4))) (and (= (store v_prenex_69 .cse0 (select v_prenex_68 .cse0)) v_prenex_68) (= (let ((.cse1 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_61|))) (store v_prenex_70 .cse1 (select |v_old(#valid)_AFTER_CALL_61| .cse1))) |v_old(#valid)_AFTER_CALL_61|) (= (select v_prenex_70 .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_61| .cse0) 1) (= (select v_prenex_70 .cse2) 1) (= .cse2 v_DerPreprocessor_51) (= (select v_prenex_70 .cse3) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1)) (= (select (select v_prenex_69 .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse2) (= (select (select .cse4 (select .cse5 4)) 4) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= (store (select v_prenex_68 .cse2) 8 (select (select .cse6 .cse2) 8)) .cse7))))))))) (exists ((v_prenex_61 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_63| Int) (v_prenex_67 Int) (v_prenex_66 (Array Int Int)) (v_arrayElimCell_279 Int)) (and (= (select v_prenex_61 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1) (= (select v_prenex_66 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 1) (= v_prenex_66 (let ((.cse8 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse8 (select v_prenex_66 .cse8)))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_61 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 0) (= (select v_prenex_66 v_prenex_67) 0) (not (= |v_ULTIMATE.start_dll_append_~last~0#1.base_63| v_arrayElimCell_279)) (= (select v_prenex_66 v_arrayElimCell_279) 1))) (exists ((v_prenex_61 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_63| Int) (v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (= (select v_prenex_61 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1) (= (select v_prenex_66 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 1) (= v_prenex_66 (let ((.cse9 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse9 (select v_prenex_66 .cse9)))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_61 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 0) (= (select v_prenex_66 v_prenex_67) 0)))) is different from false [2024-11-28 04:58:37,258 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (v_prenex_70 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_69 (Array Int (Array Int Int))) (v_prenex_68 (Array Int (Array Int Int))) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int)) (v_DerPreprocessor_51 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse0 (@diff v_prenex_69 v_prenex_68))) (let ((.cse4 (store (store (store v_prenex_68 .cse0 v_DerPreprocessor_54) v_DerPreprocessor_51 v_DerPreprocessor_55) |node_create_~temp~0#1.base| v_DerPreprocessor_56))) (let ((.cse5 (select .cse4 .cse0)) (.cse7 (select .cse4 v_DerPreprocessor_51))) (let ((.cse6 (store (store v_prenex_68 .cse0 .cse5) v_DerPreprocessor_51 .cse7))) (let ((.cse2 (select (select .cse6 .cse0) 4))) (let ((.cse3 (select (select v_prenex_69 .cse2) 4))) (and (= (store v_prenex_69 .cse0 (select v_prenex_68 .cse0)) v_prenex_68) (= (let ((.cse1 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_61|))) (store v_prenex_70 .cse1 (select |v_old(#valid)_AFTER_CALL_61| .cse1))) |v_old(#valid)_AFTER_CALL_61|) (= (select v_prenex_70 .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_61| .cse0) 1) (= (select v_prenex_70 .cse2) 1) (= .cse2 v_DerPreprocessor_51) (= (select v_prenex_70 .cse3) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1)) (= (select (select v_prenex_69 .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse2) (= (select (select .cse4 (select .cse5 4)) 4) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= (store (select v_prenex_68 .cse2) 8 (select (select .cse6 .cse2) 8)) .cse7))))))))) (exists ((v_prenex_61 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_63| Int) (v_prenex_67 Int) (v_prenex_66 (Array Int Int)) (v_arrayElimCell_279 Int)) (and (= (select v_prenex_61 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1) (= (select v_prenex_66 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 1) (= v_prenex_66 (let ((.cse8 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse8 (select v_prenex_66 .cse8)))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_61 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 0) (= (select v_prenex_66 v_prenex_67) 0) (not (= |v_ULTIMATE.start_dll_append_~last~0#1.base_63| v_arrayElimCell_279)) (= (select v_prenex_66 v_arrayElimCell_279) 1))) (exists ((v_prenex_61 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_63| Int) (v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (= (select v_prenex_61 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1) (= (select v_prenex_66 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 1) (= v_prenex_66 (let ((.cse9 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse9 (select v_prenex_66 .cse9)))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_61 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 0) (= (select v_prenex_66 v_prenex_67) 0)))) is different from true [2024-11-28 04:58:37,673 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_61 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_63| Int) (v_prenex_67 Int) (v_prenex_66 (Array Int Int)) (v_arrayElimCell_279 Int)) (and (= (select v_prenex_66 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 1) (= (select v_prenex_61 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= v_prenex_66 (let ((.cse0 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse0 (select v_prenex_66 .cse0)))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_61 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 0) (= (select v_prenex_66 v_prenex_67) 0) (not (= |v_ULTIMATE.start_dll_append_~last~0#1.base_63| v_arrayElimCell_279)) (= (select v_prenex_66 v_arrayElimCell_279) 1))) (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (v_prenex_70 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_69 (Array Int (Array Int Int))) (v_prenex_68 (Array Int (Array Int Int))) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int)) (v_DerPreprocessor_51 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse1 (@diff v_prenex_69 v_prenex_68))) (let ((.cse2 (store (store (store v_prenex_68 .cse1 v_DerPreprocessor_54) v_DerPreprocessor_51 v_DerPreprocessor_55) |node_create_~temp~0#1.base| v_DerPreprocessor_56))) (let ((.cse3 (select .cse2 .cse1)) (.cse8 (select .cse2 v_DerPreprocessor_51))) (let ((.cse7 (store (store v_prenex_68 .cse1 .cse3) v_DerPreprocessor_51 .cse8))) (let ((.cse5 (select (select .cse7 .cse1) 4))) (let ((.cse6 (select (select v_prenex_69 .cse5) 4))) (and (= (store v_prenex_69 .cse1 (select v_prenex_68 .cse1)) v_prenex_68) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select .cse2 (select .cse3 4)) 4)) (= (let ((.cse4 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_61|))) (store v_prenex_70 .cse4 (select |v_old(#valid)_AFTER_CALL_61| .cse4))) |v_old(#valid)_AFTER_CALL_61|) (= (select v_prenex_70 .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_61| .cse1) 1) (= (select v_prenex_70 .cse5) 1) (= .cse5 v_DerPreprocessor_51) (= (select v_prenex_70 .cse6) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1)) (= (select (select v_prenex_69 .cse6) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse5) (= (store (select v_prenex_68 .cse5) 8 (select (select .cse7 .cse5) 8)) .cse8))))))))) (exists ((v_prenex_61 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_63| Int) (v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (= (select v_prenex_66 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 1) (= (select v_prenex_61 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= v_prenex_66 (let ((.cse9 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse9 (select v_prenex_66 .cse9)))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_61 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 0) (= (select v_prenex_66 v_prenex_67) 0)))) is different from false [2024-11-28 04:58:41,894 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_61 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_63| Int) (v_prenex_67 Int) (v_prenex_66 (Array Int Int)) (v_arrayElimCell_279 Int)) (and (= (select v_prenex_66 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 1) (= (select v_prenex_61 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= v_prenex_66 (let ((.cse0 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse0 (select v_prenex_66 .cse0)))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_61 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 0) (= (select v_prenex_66 v_prenex_67) 0) (not (= |v_ULTIMATE.start_dll_append_~last~0#1.base_63| v_arrayElimCell_279)) (= (select v_prenex_66 v_arrayElimCell_279) 1))) (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (v_prenex_70 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_69 (Array Int (Array Int Int))) (v_prenex_68 (Array Int (Array Int Int))) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int)) (v_DerPreprocessor_51 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse1 (@diff v_prenex_69 v_prenex_68))) (let ((.cse2 (store (store (store v_prenex_68 .cse1 v_DerPreprocessor_54) v_DerPreprocessor_51 v_DerPreprocessor_55) |node_create_~temp~0#1.base| v_DerPreprocessor_56))) (let ((.cse3 (select .cse2 .cse1)) (.cse8 (select .cse2 v_DerPreprocessor_51))) (let ((.cse7 (store (store v_prenex_68 .cse1 .cse3) v_DerPreprocessor_51 .cse8))) (let ((.cse5 (select (select .cse7 .cse1) 4))) (let ((.cse6 (select (select v_prenex_69 .cse5) 4))) (and (= (store v_prenex_69 .cse1 (select v_prenex_68 .cse1)) v_prenex_68) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select .cse2 (select .cse3 4)) 4)) (= (let ((.cse4 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_61|))) (store v_prenex_70 .cse4 (select |v_old(#valid)_AFTER_CALL_61| .cse4))) |v_old(#valid)_AFTER_CALL_61|) (= (select v_prenex_70 .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_61| .cse1) 1) (= (select v_prenex_70 .cse5) 1) (= .cse5 v_DerPreprocessor_51) (= (select v_prenex_70 .cse6) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1)) (= (select (select v_prenex_69 .cse6) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse5) (= (store (select v_prenex_68 .cse5) 8 (select (select .cse7 .cse5) 8)) .cse8))))))))) (exists ((v_prenex_61 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_63| Int) (v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (= (select v_prenex_66 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 1) (= (select v_prenex_61 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= v_prenex_66 (let ((.cse9 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse9 (select v_prenex_66 .cse9)))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_61 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 0) (= (select v_prenex_66 v_prenex_67) 0)))) is different from true [2024-11-28 04:58:41,897 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 35 not checked. [2024-11-28 04:58:41,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:58:43,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192941763] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:58:43,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:58:43,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34] total 62 [2024-11-28 04:58:43,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108696436] [2024-11-28 04:58:43,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:58:43,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-11-28 04:58:43,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:58:43,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-11-28 04:58:43,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2294, Unknown=40, NotChecked=2300, Total=4830 [2024-11-28 04:58:43,578 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand has 63 states, 60 states have (on average 2.0) internal successors, (120), 56 states have internal predecessors, (120), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-28 04:58:47,180 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse1 (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (= (select |c_#valid| .cse0) 1) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) .cse1 (or (and .cse1 (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_56| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse2 (select |c_#valid| .cse2))))))) (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse3 (select |c_#valid| .cse3)))) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse5 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse4 (select |c_#memory_$Pointer$#2.base| .cse4)) |c_#memory_$Pointer$#2.base|) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse5) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_#valid_BEFORE_CALL_56| .cse5) 1) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| .cse4))))))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (<= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2024-11-28 04:58:47,189 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse1 (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (= (select |c_#valid| .cse0) 1) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) .cse1 (or (and .cse1 (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_56| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse2 (select |c_#valid| .cse2))))))) (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse3 (select |c_#valid| .cse3)))) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse5 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse4 (select |c_#memory_$Pointer$#2.base| .cse4)) |c_#memory_$Pointer$#2.base|) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse5) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_#valid_BEFORE_CALL_56| .cse5) 1) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| .cse4))))))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (<= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from true [2024-11-28 04:58:47,207 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (<= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (or (and (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_#valid_BEFORE_CALL_56| .cse3) 1) (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse4 (select |c_#valid| .cse4)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select |c_#valid| .cse0) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) is different from false [2024-11-28 04:58:47,217 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (<= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (or (and (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_#valid_BEFORE_CALL_56| .cse3) 1) (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse4 (select |c_#valid| .cse4)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select |c_#valid| .cse0) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) is different from true [2024-11-28 04:58:47,234 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select |c_#valid| .cse0) 1) (or (and (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int)))) (and (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse2 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|))) (and (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_#valid_BEFORE_CALL_56| .cse2) 1) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3 (select |v_#memory_$Pointer$#2.base_294| .cse3))) (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse4 (select |c_#valid| .cse4)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (= (store |v_#memory_$Pointer$#2.base_294| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) |c_#memory_$Pointer$#2.base|)))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) is different from false [2024-11-28 04:58:47,244 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select |c_#valid| .cse0) 1) (or (and (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int)))) (and (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse2 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|))) (and (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_#valid_BEFORE_CALL_56| .cse2) 1) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3 (select |v_#memory_$Pointer$#2.base_294| .cse3))) (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse4 (select |c_#valid| .cse4)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (= (store |v_#memory_$Pointer$#2.base_294| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) |c_#memory_$Pointer$#2.base|)))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) is different from true [2024-11-28 04:58:47,263 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse1 (= (select .cse5 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select |c_#valid| .cse0) 1) (not (= (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4) 0)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) .cse1 (or (and (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) .cse1) (and .cse1 (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_#valid_BEFORE_CALL_56| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|))) (and (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_#valid_BEFORE_CALL_56| .cse3) 1) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse4 (select |v_#memory_$Pointer$#2.base_294| .cse4))) (= .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (store |v_#memory_$Pointer$#2.base_294| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse5) |c_#memory_$Pointer$#2.base|) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse6 (select |c_#valid| .cse6)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))))))))) is different from false [2024-11-28 04:58:47,273 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse1 (= (select .cse5 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select |c_#valid| .cse0) 1) (not (= (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4) 0)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) .cse1 (or (and (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) .cse1) (and .cse1 (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_#valid_BEFORE_CALL_56| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|))) (and (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_#valid_BEFORE_CALL_56| .cse3) 1) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse4 (select |v_#memory_$Pointer$#2.base_294| .cse4))) (= .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (store |v_#memory_$Pointer$#2.base_294| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse5) |c_#memory_$Pointer$#2.base|) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse6 (select |c_#valid| .cse6)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))))))))) is different from true [2024-11-28 04:58:47,289 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse1 (select .cse7 4))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse1))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (.cse2 (select .cse8 4)) (.cse5 (= (select |c_#valid| .cse1) 1))) (and .cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (let ((.cse4 (or .cse0 (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (or (and (or (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)))) (= .cse1 .cse2)) (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse2) 1) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) .cse4 .cse5) (and .cse4 (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_#valid_BEFORE_CALL_56| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse9 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse6 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse1) 4))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse6) 1) (= (store (store |v_#memory_$Pointer$#2.base_294| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse7) .cse1 (store (select |v_#memory_$Pointer$#2.base_294| .cse1) 8 (select .cse8 8))) |c_#memory_$Pointer$#2.base|) (= (select |v_#valid_BEFORE_CALL_56| .cse1) 1) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse9 (select |v_#memory_$Pointer$#2.base_294| .cse9))) (= .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= .cse1 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse6) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8))) (= |c_#valid| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse10 (select |c_#valid| .cse10)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))) .cse5))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= (select .cse8 (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |c_#valid| .cse2) 1) .cse5))))) is different from false [2024-11-28 04:58:47,297 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse1 (select .cse7 4))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse1))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (.cse2 (select .cse8 4)) (.cse5 (= (select |c_#valid| .cse1) 1))) (and .cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (let ((.cse4 (or .cse0 (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (or (and (or (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)))) (= .cse1 .cse2)) (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse2) 1) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) .cse4 .cse5) (and .cse4 (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_#valid_BEFORE_CALL_56| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse9 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse6 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse1) 4))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse6) 1) (= (store (store |v_#memory_$Pointer$#2.base_294| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse7) .cse1 (store (select |v_#memory_$Pointer$#2.base_294| .cse1) 8 (select .cse8 8))) |c_#memory_$Pointer$#2.base|) (= (select |v_#valid_BEFORE_CALL_56| .cse1) 1) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse9 (select |v_#memory_$Pointer$#2.base_294| .cse9))) (= .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= .cse1 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse6) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8))) (= |c_#valid| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse10 (select |c_#valid| .cse10)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))) .cse5))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= (select .cse8 (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |c_#valid| .cse2) 1) .cse5))))) is different from true [2024-11-28 04:58:47,314 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse6 (select .cse10 4))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse6))) (let ((.cse3 (select .cse1 4)) (.cse0 (= (select |c_#valid| .cse6) 1)) (.cse2 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse0 (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= (select .cse1 (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) .cse2 (= (select |c_#valid| .cse3) 1) (let ((.cse4 (or .cse2 (= .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (or (and .cse4 .cse0 (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse5 (select |c_#valid| .cse5)))) (= (select |v_#valid_BEFORE_CALL_56| .cse3) 1))) (or (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse6)) (= .cse6 .cse3))) (and .cse4 .cse0 (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_#valid_BEFORE_CALL_56| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse7 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse8 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse6) 4))) (and (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse7 (select |v_#memory_$Pointer$#2.base_294| .cse7))) (= (select |v_#valid_BEFORE_CALL_56| .cse6) 1) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse8) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse6) (= .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= |c_#valid| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse9 (select |c_#valid| .cse9)))) (= (store (store |v_#memory_$Pointer$#2.base_294| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse10) .cse6 (store (select |v_#memory_$Pointer$#2.base_294| .cse6) 8 (select .cse1 8))) |c_#memory_$Pointer$#2.base|) (= (select |v_#valid_BEFORE_CALL_56| .cse8) 1))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))))) is different from false [2024-11-28 04:58:47,321 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse6 (select .cse10 4))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse6))) (let ((.cse3 (select .cse1 4)) (.cse0 (= (select |c_#valid| .cse6) 1)) (.cse2 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse0 (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= (select .cse1 (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) .cse2 (= (select |c_#valid| .cse3) 1) (let ((.cse4 (or .cse2 (= .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (or (and .cse4 .cse0 (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse5 (select |c_#valid| .cse5)))) (= (select |v_#valid_BEFORE_CALL_56| .cse3) 1))) (or (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse6)) (= .cse6 .cse3))) (and .cse4 .cse0 (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_#valid_BEFORE_CALL_56| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse7 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse8 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse6) 4))) (and (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse7 (select |v_#memory_$Pointer$#2.base_294| .cse7))) (= (select |v_#valid_BEFORE_CALL_56| .cse6) 1) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse8) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse6) (= .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= |c_#valid| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse9 (select |c_#valid| .cse9)))) (= (store (store |v_#memory_$Pointer$#2.base_294| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse10) .cse6 (store (select |v_#memory_$Pointer$#2.base_294| .cse6) 8 (select .cse1 8))) |c_#memory_$Pointer$#2.base|) (= (select |v_#valid_BEFORE_CALL_56| .cse8) 1))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))))) is different from true [2024-11-28 04:58:47,335 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse5 (select .cse9 4))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse5))) (let ((.cse2 (select .cse10 4)) (.cse0 (= (select |c_#valid| .cse5) 1)) (.cse1 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse0 .cse1 (= (select |c_#valid| .cse2) 1) (let ((.cse3 (or .cse1 (= .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (or (and .cse3 .cse0 (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse4 (select |c_#valid| .cse4)))) (= (select |v_#valid_BEFORE_CALL_56| .cse2) 1))) (or (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse5)) (= .cse5 .cse2))) (and .cse3 .cse0 (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_#valid_BEFORE_CALL_56| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse6 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse7 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse5) 4))) (and (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse6 (select |v_#memory_$Pointer$#2.base_294| .cse6))) (= (select |v_#valid_BEFORE_CALL_56| .cse5) 1) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse7) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse5) (= .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= |c_#valid| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse8 (select |c_#valid| .cse8)))) (= (store (store |v_#memory_$Pointer$#2.base_294| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse9) .cse5 (store (select |v_#memory_$Pointer$#2.base_294| .cse5) 8 (select .cse10 8))) |c_#memory_$Pointer$#2.base|) (= (select |v_#valid_BEFORE_CALL_56| .cse7) 1))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))))) is different from false [2024-11-28 04:58:47,343 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse5 (select .cse9 4))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse5))) (let ((.cse2 (select .cse10 4)) (.cse0 (= (select |c_#valid| .cse5) 1)) (.cse1 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse0 .cse1 (= (select |c_#valid| .cse2) 1) (let ((.cse3 (or .cse1 (= .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (or (and .cse3 .cse0 (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse4 (select |c_#valid| .cse4)))) (= (select |v_#valid_BEFORE_CALL_56| .cse2) 1))) (or (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse5)) (= .cse5 .cse2))) (and .cse3 .cse0 (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_#valid_BEFORE_CALL_56| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse6 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse7 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse5) 4))) (and (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse6 (select |v_#memory_$Pointer$#2.base_294| .cse6))) (= (select |v_#valid_BEFORE_CALL_56| .cse5) 1) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse7) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse5) (= .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= |c_#valid| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse8 (select |c_#valid| .cse8)))) (= (store (store |v_#memory_$Pointer$#2.base_294| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse9) .cse5 (store (select |v_#memory_$Pointer$#2.base_294| .cse5) 8 (select .cse10 8))) |c_#memory_$Pointer$#2.base|) (= (select |v_#valid_BEFORE_CALL_56| .cse7) 1))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))))) is different from true [2024-11-28 04:58:47,358 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse3 (select .cse7 4))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse3))) (let ((.cse0 (select .cse8 4)) (.cse4 (= (select |c_#valid| .cse3) 1)) (.cse10 (= 0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4)))) (and (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse1 (or (= .cse3 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse10))) (or (and .cse1 (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) (or (= .cse0 .cse3) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse3))) .cse4) (and .cse1 (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_#valid_BEFORE_CALL_56| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse5 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3) 4)) (.cse6 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse5) 1) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse6 (select |v_#memory_$Pointer$#2.base_294| .cse6))) (= (store (store |v_#memory_$Pointer$#2.base_294| |c_ULTIMATE.start_dll_create_#res#1.base| .cse7) .cse3 (store (select |v_#memory_$Pointer$#2.base_294| .cse3) 8 (select .cse8 8))) |c_#memory_$Pointer$#2.base|) (= .cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse5) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8))) (= |c_#valid| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse9 (select |c_#valid| .cse9)))) (= .cse6 |c_ULTIMATE.start_dll_create_#res#1.base|) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_56| .cse3) 1)))) .cse4))) .cse4 (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) .cse10))))) is different from false [2024-11-28 04:58:47,365 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse3 (select .cse7 4))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse3))) (let ((.cse0 (select .cse8 4)) (.cse4 (= (select |c_#valid| .cse3) 1)) (.cse10 (= 0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4)))) (and (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse1 (or (= .cse3 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse10))) (or (and .cse1 (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) (or (= .cse0 .cse3) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse3))) .cse4) (and .cse1 (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_#valid_BEFORE_CALL_56| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse5 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3) 4)) (.cse6 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse5) 1) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse6 (select |v_#memory_$Pointer$#2.base_294| .cse6))) (= (store (store |v_#memory_$Pointer$#2.base_294| |c_ULTIMATE.start_dll_create_#res#1.base| .cse7) .cse3 (store (select |v_#memory_$Pointer$#2.base_294| .cse3) 8 (select .cse8 8))) |c_#memory_$Pointer$#2.base|) (= .cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse5) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8))) (= |c_#valid| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse9 (select |c_#valid| .cse9)))) (= .cse6 |c_ULTIMATE.start_dll_create_#res#1.base|) (= (select |v_#valid_BEFORE_CALL_56| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_56| .cse3) 1)))) .cse4))) .cse4 (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) .cse10))))) is different from true [2024-11-28 04:58:47,384 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|))) (let ((.cse1 (select .cse14 |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse0 (select .cse14 0)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|)) (.cse13 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| .cse1) 1) (= (select .cse2 |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse7 (select .cse10 4))) (let ((.cse3 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= .cse7 .cse0))) (.cse4 (= (select |c_#valid| .cse7) 1)) (.cse8 (select |c_#memory_$Pointer$#2.base| .cse7))) (or (let ((.cse5 (select .cse8 4))) (and .cse3 .cse4 (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_56| .cse5) 1) (= |c_#valid| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse6 (select |c_#valid| .cse6)))))) (or (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= .cse7 (select (select |c_#memory_$Pointer$#2.base| .cse5) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)))) (= .cse7 .cse5)))) (and .cse3 .cse4 (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_#valid_BEFORE_CALL_56| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse9 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse11 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse7) 4))) (and (= .cse9 .cse0) (= (select |v_#valid_BEFORE_CALL_56| .cse7) 1) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse9 (select |v_#memory_$Pointer$#2.base_294| .cse9))) (= |c_#memory_$Pointer$#2.base| (store (store |v_#memory_$Pointer$#2.base_294| .cse0 .cse10) .cse7 (store (select |v_#memory_$Pointer$#2.base_294| .cse7) 8 (select .cse8 8)))) (= (select |v_#valid_BEFORE_CALL_56| .cse0) 0) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse11) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse7) (= |c_#valid| (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse12 (select |c_#valid| .cse12)))) (= (select |v_#valid_BEFORE_CALL_56| .cse11) 1))))))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select .cse2 0) 0) (= (select |c_#valid| .cse13) 1) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#2.base| .cse13) 4)) 1) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from false [2024-11-28 04:58:47,392 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|))) (let ((.cse1 (select .cse14 |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse0 (select .cse14 0)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|)) (.cse13 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| .cse1) 1) (= (select .cse2 |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse7 (select .cse10 4))) (let ((.cse3 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= .cse7 .cse0))) (.cse4 (= (select |c_#valid| .cse7) 1)) (.cse8 (select |c_#memory_$Pointer$#2.base| .cse7))) (or (let ((.cse5 (select .cse8 4))) (and .cse3 .cse4 (exists ((|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_56| .cse5) 1) (= |c_#valid| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse6 (select |c_#valid| .cse6)))))) (or (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (= .cse7 (select (select |c_#memory_$Pointer$#2.base| .cse5) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)))) (= .cse7 .cse5)))) (and .cse3 .cse4 (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_#valid_BEFORE_CALL_56| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse9 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse11 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse7) 4))) (and (= .cse9 .cse0) (= (select |v_#valid_BEFORE_CALL_56| .cse7) 1) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse9 (select |v_#memory_$Pointer$#2.base_294| .cse9))) (= |c_#memory_$Pointer$#2.base| (store (store |v_#memory_$Pointer$#2.base_294| .cse0 .cse10) .cse7 (store (select |v_#memory_$Pointer$#2.base_294| .cse7) 8 (select .cse8 8)))) (= (select |v_#valid_BEFORE_CALL_56| .cse0) 0) (= (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse11) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse7) (= |c_#valid| (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_56| |c_#valid|))) (store |v_#valid_BEFORE_CALL_56| .cse12 (select |c_#valid| .cse12)))) (= (select |v_#valid_BEFORE_CALL_56| .cse11) 1))))))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select .cse2 0) 0) (= (select |c_#valid| .cse13) 1) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#2.base| .cse13) 4)) 1) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from true [2024-11-28 04:58:47,418 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (<= |c_node_create_~temp~0#1.offset| 0) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (v_DerPreprocessor_44 Int) (v_prenex_56 Int) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (v_prenex_55 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse5 (store (store |v_#memory_$Pointer$#2.base_294| .cse3 v_DerPreprocessor_45) v_DerPreprocessor_44 v_DerPreprocessor_46))) (let ((.cse4 (select (select .cse5 .cse3) 4))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse6 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse4) 4))) (and (= |v_#valid_BEFORE_CALL_57| (let ((.cse1 (@diff v_prenex_55 |v_#valid_BEFORE_CALL_57|))) (store v_prenex_55 .cse1 (select |v_#valid_BEFORE_CALL_57| .cse1)))) (= .cse2 .cse3) (= (store (select |v_#memory_$Pointer$#2.base_294| .cse4) 8 (select (select .cse5 .cse4) 8)) v_DerPreprocessor_46) (= v_DerPreprocessor_44 .cse4) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse2 (select |v_#memory_$Pointer$#2.base_294| .cse2))) (= (select v_prenex_55 .cse4) 1) (= .cse4 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse6) (+ v_prenex_56 8))) (= (select v_prenex_55 .cse3) 0) (= (select v_prenex_55 .cse6) 1)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse3) 1)))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((v_arrayElimIndex_20 Int) (|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| v_arrayElimIndex_20) 1) (= (select |v_#valid_BEFORE_CALL_56| .cse7) 0) (= |v_#valid_BEFORE_CALL_57| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_56| |v_#valid_BEFORE_CALL_57|))) (store |v_#valid_BEFORE_CALL_56| .cse8 (select |v_#valid_BEFORE_CALL_57| .cse8)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse7) 1) (exists ((v_arrayElimIndex_21 Int)) (and (not (= .cse7 v_arrayElimIndex_21)) (= (select |v_#valid_BEFORE_CALL_57| v_arrayElimIndex_21) 1))))))))) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) is different from false [2024-11-28 04:58:47,427 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (<= |c_node_create_~temp~0#1.offset| 0) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (v_DerPreprocessor_44 Int) (v_prenex_56 Int) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (v_prenex_55 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse5 (store (store |v_#memory_$Pointer$#2.base_294| .cse3 v_DerPreprocessor_45) v_DerPreprocessor_44 v_DerPreprocessor_46))) (let ((.cse4 (select (select .cse5 .cse3) 4))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse6 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse4) 4))) (and (= |v_#valid_BEFORE_CALL_57| (let ((.cse1 (@diff v_prenex_55 |v_#valid_BEFORE_CALL_57|))) (store v_prenex_55 .cse1 (select |v_#valid_BEFORE_CALL_57| .cse1)))) (= .cse2 .cse3) (= (store (select |v_#memory_$Pointer$#2.base_294| .cse4) 8 (select (select .cse5 .cse4) 8)) v_DerPreprocessor_46) (= v_DerPreprocessor_44 .cse4) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse2 (select |v_#memory_$Pointer$#2.base_294| .cse2))) (= (select v_prenex_55 .cse4) 1) (= .cse4 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse6) (+ v_prenex_56 8))) (= (select v_prenex_55 .cse3) 0) (= (select v_prenex_55 .cse6) 1)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse3) 1)))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((v_arrayElimIndex_20 Int) (|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| v_arrayElimIndex_20) 1) (= (select |v_#valid_BEFORE_CALL_56| .cse7) 0) (= |v_#valid_BEFORE_CALL_57| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_56| |v_#valid_BEFORE_CALL_57|))) (store |v_#valid_BEFORE_CALL_56| .cse8 (select |v_#valid_BEFORE_CALL_57| .cse8)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse7) 1) (exists ((v_arrayElimIndex_21 Int)) (and (not (= .cse7 v_arrayElimIndex_21)) (= (select |v_#valid_BEFORE_CALL_57| v_arrayElimIndex_21) 1))))))))) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) is different from true [2024-11-28 04:58:47,456 WARN L851 $PredicateComparison]: unable to prove that (and (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (<= |c_node_create_~temp~0#1.offset| 0) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (v_DerPreprocessor_44 Int) (v_prenex_56 Int) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (v_prenex_55 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse4 (store (store |v_#memory_$Pointer$#2.base_294| .cse2 v_DerPreprocessor_45) v_DerPreprocessor_44 v_DerPreprocessor_46))) (let ((.cse3 (select (select .cse4 .cse2) 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse5 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3) 4))) (and (= |v_#valid_BEFORE_CALL_57| (let ((.cse0 (@diff v_prenex_55 |v_#valid_BEFORE_CALL_57|))) (store v_prenex_55 .cse0 (select |v_#valid_BEFORE_CALL_57| .cse0)))) (= .cse1 .cse2) (= (store (select |v_#memory_$Pointer$#2.base_294| .cse3) 8 (select (select .cse4 .cse3) 8)) v_DerPreprocessor_46) (= v_DerPreprocessor_44 .cse3) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse1 (select |v_#memory_$Pointer$#2.base_294| .cse1))) (= (select v_prenex_55 .cse3) 1) (= .cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse5) (+ v_prenex_56 8))) (= (select v_prenex_55 .cse2) 0) (= (select v_prenex_55 .cse5) 1)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse2) 1)))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((v_arrayElimIndex_20 Int) (|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| v_arrayElimIndex_20) 1) (= (select |v_#valid_BEFORE_CALL_56| .cse6) 0) (= |v_#valid_BEFORE_CALL_57| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_56| |v_#valid_BEFORE_CALL_57|))) (store |v_#valid_BEFORE_CALL_56| .cse7 (select |v_#valid_BEFORE_CALL_57| .cse7)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse6) 1) (exists ((v_arrayElimIndex_21 Int)) (and (not (= .cse6 v_arrayElimIndex_21)) (= (select |v_#valid_BEFORE_CALL_57| v_arrayElimIndex_21) 1))))))))) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-28 04:58:47,465 WARN L873 $PredicateComparison]: unable to prove that (and (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (<= |c_node_create_~temp~0#1.offset| 0) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (v_DerPreprocessor_44 Int) (v_prenex_56 Int) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (v_prenex_55 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse4 (store (store |v_#memory_$Pointer$#2.base_294| .cse2 v_DerPreprocessor_45) v_DerPreprocessor_44 v_DerPreprocessor_46))) (let ((.cse3 (select (select .cse4 .cse2) 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse5 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3) 4))) (and (= |v_#valid_BEFORE_CALL_57| (let ((.cse0 (@diff v_prenex_55 |v_#valid_BEFORE_CALL_57|))) (store v_prenex_55 .cse0 (select |v_#valid_BEFORE_CALL_57| .cse0)))) (= .cse1 .cse2) (= (store (select |v_#memory_$Pointer$#2.base_294| .cse3) 8 (select (select .cse4 .cse3) 8)) v_DerPreprocessor_46) (= v_DerPreprocessor_44 .cse3) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse1 (select |v_#memory_$Pointer$#2.base_294| .cse1))) (= (select v_prenex_55 .cse3) 1) (= .cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse5) (+ v_prenex_56 8))) (= (select v_prenex_55 .cse2) 0) (= (select v_prenex_55 .cse5) 1)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse2) 1)))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((v_arrayElimIndex_20 Int) (|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| v_arrayElimIndex_20) 1) (= (select |v_#valid_BEFORE_CALL_56| .cse6) 0) (= |v_#valid_BEFORE_CALL_57| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_56| |v_#valid_BEFORE_CALL_57|))) (store |v_#valid_BEFORE_CALL_56| .cse7 (select |v_#valid_BEFORE_CALL_57| .cse7)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse6) 1) (exists ((v_arrayElimIndex_21 Int)) (and (not (= .cse6 v_arrayElimIndex_21)) (= (select |v_#valid_BEFORE_CALL_57| v_arrayElimIndex_21) 1))))))))) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-28 04:58:47,507 WARN L851 $PredicateComparison]: unable to prove that (and (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (<= |c_node_create_~temp~0#1.offset| 0) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (v_DerPreprocessor_44 Int) (v_prenex_56 Int) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (v_prenex_55 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse4 (store (store |v_#memory_$Pointer$#2.base_294| .cse2 v_DerPreprocessor_45) v_DerPreprocessor_44 v_DerPreprocessor_46))) (let ((.cse3 (select (select .cse4 .cse2) 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse5 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3) 4))) (and (= |v_#valid_BEFORE_CALL_57| (let ((.cse0 (@diff v_prenex_55 |v_#valid_BEFORE_CALL_57|))) (store v_prenex_55 .cse0 (select |v_#valid_BEFORE_CALL_57| .cse0)))) (= .cse1 .cse2) (= (store (select |v_#memory_$Pointer$#2.base_294| .cse3) 8 (select (select .cse4 .cse3) 8)) v_DerPreprocessor_46) (= v_DerPreprocessor_44 .cse3) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse1 (select |v_#memory_$Pointer$#2.base_294| .cse1))) (= (select v_prenex_55 .cse3) 1) (= .cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse5) (+ v_prenex_56 8))) (= (select v_prenex_55 .cse2) 0) (= (select v_prenex_55 .cse5) 1)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse2) 1)))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((v_arrayElimIndex_20 Int) (|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| v_arrayElimIndex_20) 1) (= (select |v_#valid_BEFORE_CALL_56| .cse6) 0) (= |v_#valid_BEFORE_CALL_57| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_56| |v_#valid_BEFORE_CALL_57|))) (store |v_#valid_BEFORE_CALL_56| .cse7 (select |v_#valid_BEFORE_CALL_57| .cse7)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse6) 1) (exists ((v_arrayElimIndex_21 Int)) (and (not (= .cse6 v_arrayElimIndex_21)) (= (select |v_#valid_BEFORE_CALL_57| v_arrayElimIndex_21) 1))))))))) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-28 04:58:47,520 WARN L873 $PredicateComparison]: unable to prove that (and (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (<= |c_node_create_~temp~0#1.offset| 0) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (v_DerPreprocessor_44 Int) (v_prenex_56 Int) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (v_prenex_55 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse4 (store (store |v_#memory_$Pointer$#2.base_294| .cse2 v_DerPreprocessor_45) v_DerPreprocessor_44 v_DerPreprocessor_46))) (let ((.cse3 (select (select .cse4 .cse2) 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse5 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3) 4))) (and (= |v_#valid_BEFORE_CALL_57| (let ((.cse0 (@diff v_prenex_55 |v_#valid_BEFORE_CALL_57|))) (store v_prenex_55 .cse0 (select |v_#valid_BEFORE_CALL_57| .cse0)))) (= .cse1 .cse2) (= (store (select |v_#memory_$Pointer$#2.base_294| .cse3) 8 (select (select .cse4 .cse3) 8)) v_DerPreprocessor_46) (= v_DerPreprocessor_44 .cse3) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse1 (select |v_#memory_$Pointer$#2.base_294| .cse1))) (= (select v_prenex_55 .cse3) 1) (= .cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse5) (+ v_prenex_56 8))) (= (select v_prenex_55 .cse2) 0) (= (select v_prenex_55 .cse5) 1)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse2) 1)))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((v_arrayElimIndex_20 Int) (|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| v_arrayElimIndex_20) 1) (= (select |v_#valid_BEFORE_CALL_56| .cse6) 0) (= |v_#valid_BEFORE_CALL_57| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_56| |v_#valid_BEFORE_CALL_57|))) (store |v_#valid_BEFORE_CALL_56| .cse7 (select |v_#valid_BEFORE_CALL_57| .cse7)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse6) 1) (exists ((v_arrayElimIndex_21 Int)) (and (not (= .cse6 v_arrayElimIndex_21)) (= (select |v_#valid_BEFORE_CALL_57| v_arrayElimIndex_21) 1))))))))) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-28 04:58:47,845 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse19 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) (.cse4 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|))) (let ((.cse6 (store |c_old(#memory_$Pointer$#2.offset)| .cse4 (select |c_#memory_$Pointer$#2.offset| .cse4))) (.cse3 (store |c_old(#memory_$Pointer$#2.base)| .cse19 (select |c_#memory_$Pointer$#2.base| .cse19)))) (let ((.cse2 (@diff .cse3 |c_#memory_$Pointer$#2.base|)) (.cse5 (@diff .cse6 |c_#memory_$Pointer$#2.offset|))) (let ((.cse10 (@diff |c_old(#valid)| |c_#valid|)) (.cse8 (store .cse6 .cse5 (select |c_#memory_$Pointer$#2.offset| .cse5))) (.cse0 (store .cse3 .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)))) (let ((.cse1 (@diff .cse0 |c_#memory_$Pointer$#2.base|)) (.cse9 (@diff .cse8 |c_#memory_$Pointer$#2.offset|)) (.cse7 (select |c_#valid| .cse10))) (and (= (store .cse0 .cse1 (select |c_#memory_$Pointer$#2.base| .cse1)) |c_#memory_$Pointer$#2.base|) (= |c_node_create_#res#1.offset| 0) (or (= (select |c_old(#valid)| .cse2) 0) (= .cse3 |c_#memory_$Pointer$#2.base|)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) (or (= (select |c_old(#valid)| .cse4) 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|)) (or (= 0 (select |c_old(#valid)| .cse5)) (= .cse6 |c_#memory_$Pointer$#2.offset|)) (<= |c_node_create_#res#1.offset| 0) (or (= (select |c_old(#valid)| .cse1) 0) (= .cse0 |c_#memory_$Pointer$#2.base|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (or (= |c_#valid| |c_old(#valid)|) (= .cse7 1)) (= |c_#memory_$Pointer$#2.offset| (store .cse8 .cse9 (select |c_#memory_$Pointer$#2.offset| .cse9))) (or (= .cse8 |c_#memory_$Pointer$#2.offset|) (= (select |c_old(#valid)| .cse9) 0)) (= |c_#valid| (store |c_old(#valid)| .cse10 .cse7)) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (v_DerPreprocessor_44 Int) (v_prenex_56 Int) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (v_prenex_55 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse15 (store (store |v_#memory_$Pointer$#2.base_294| .cse13 v_DerPreprocessor_45) v_DerPreprocessor_44 v_DerPreprocessor_46))) (let ((.cse14 (select (select .cse15 .cse13) 4))) (let ((.cse12 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse16 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse14) 4))) (and (= |v_#valid_BEFORE_CALL_57| (let ((.cse11 (@diff v_prenex_55 |v_#valid_BEFORE_CALL_57|))) (store v_prenex_55 .cse11 (select |v_#valid_BEFORE_CALL_57| .cse11)))) (= .cse12 .cse13) (= (store (select |v_#memory_$Pointer$#2.base_294| .cse14) 8 (select (select .cse15 .cse14) 8)) v_DerPreprocessor_46) (= v_DerPreprocessor_44 .cse14) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse12 (select |v_#memory_$Pointer$#2.base_294| .cse12))) (= (select v_prenex_55 .cse14) 1) (= .cse14 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse16) (+ v_prenex_56 8))) (= (select v_prenex_55 .cse13) 0) (= (select v_prenex_55 .cse16) 1)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse13) 1)))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse17 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((v_arrayElimIndex_20 Int) (|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| v_arrayElimIndex_20) 1) (= (select |v_#valid_BEFORE_CALL_56| .cse17) 0) (= |v_#valid_BEFORE_CALL_57| (let ((.cse18 (@diff |v_#valid_BEFORE_CALL_56| |v_#valid_BEFORE_CALL_57|))) (store |v_#valid_BEFORE_CALL_56| .cse18 (select |v_#valid_BEFORE_CALL_57| .cse18)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse17) 1) (exists ((v_arrayElimIndex_21 Int)) (and (not (= .cse17 v_arrayElimIndex_21)) (= (select |v_#valid_BEFORE_CALL_57| v_arrayElimIndex_21) 1))))))))) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse19) 0)))))))) is different from false [2024-11-28 04:58:49,337 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse19 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) (.cse4 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|))) (let ((.cse6 (store |c_old(#memory_$Pointer$#2.offset)| .cse4 (select |c_#memory_$Pointer$#2.offset| .cse4))) (.cse3 (store |c_old(#memory_$Pointer$#2.base)| .cse19 (select |c_#memory_$Pointer$#2.base| .cse19)))) (let ((.cse2 (@diff .cse3 |c_#memory_$Pointer$#2.base|)) (.cse5 (@diff .cse6 |c_#memory_$Pointer$#2.offset|))) (let ((.cse10 (@diff |c_old(#valid)| |c_#valid|)) (.cse8 (store .cse6 .cse5 (select |c_#memory_$Pointer$#2.offset| .cse5))) (.cse0 (store .cse3 .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)))) (let ((.cse1 (@diff .cse0 |c_#memory_$Pointer$#2.base|)) (.cse9 (@diff .cse8 |c_#memory_$Pointer$#2.offset|)) (.cse7 (select |c_#valid| .cse10))) (and (= (store .cse0 .cse1 (select |c_#memory_$Pointer$#2.base| .cse1)) |c_#memory_$Pointer$#2.base|) (= |c_node_create_#res#1.offset| 0) (or (= (select |c_old(#valid)| .cse2) 0) (= .cse3 |c_#memory_$Pointer$#2.base|)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) (or (= (select |c_old(#valid)| .cse4) 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|)) (or (= 0 (select |c_old(#valid)| .cse5)) (= .cse6 |c_#memory_$Pointer$#2.offset|)) (<= |c_node_create_#res#1.offset| 0) (or (= (select |c_old(#valid)| .cse1) 0) (= .cse0 |c_#memory_$Pointer$#2.base|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (or (= |c_#valid| |c_old(#valid)|) (= .cse7 1)) (= |c_#memory_$Pointer$#2.offset| (store .cse8 .cse9 (select |c_#memory_$Pointer$#2.offset| .cse9))) (or (= .cse8 |c_#memory_$Pointer$#2.offset|) (= (select |c_old(#valid)| .cse9) 0)) (= |c_#valid| (store |c_old(#valid)| .cse10 .cse7)) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (v_DerPreprocessor_44 Int) (v_prenex_56 Int) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (v_prenex_55 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse15 (store (store |v_#memory_$Pointer$#2.base_294| .cse13 v_DerPreprocessor_45) v_DerPreprocessor_44 v_DerPreprocessor_46))) (let ((.cse14 (select (select .cse15 .cse13) 4))) (let ((.cse12 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse16 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse14) 4))) (and (= |v_#valid_BEFORE_CALL_57| (let ((.cse11 (@diff v_prenex_55 |v_#valid_BEFORE_CALL_57|))) (store v_prenex_55 .cse11 (select |v_#valid_BEFORE_CALL_57| .cse11)))) (= .cse12 .cse13) (= (store (select |v_#memory_$Pointer$#2.base_294| .cse14) 8 (select (select .cse15 .cse14) 8)) v_DerPreprocessor_46) (= v_DerPreprocessor_44 .cse14) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse12 (select |v_#memory_$Pointer$#2.base_294| .cse12))) (= (select v_prenex_55 .cse14) 1) (= .cse14 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse16) (+ v_prenex_56 8))) (= (select v_prenex_55 .cse13) 0) (= (select v_prenex_55 .cse16) 1)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse13) 1)))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse17 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((v_arrayElimIndex_20 Int) (|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| v_arrayElimIndex_20) 1) (= (select |v_#valid_BEFORE_CALL_56| .cse17) 0) (= |v_#valid_BEFORE_CALL_57| (let ((.cse18 (@diff |v_#valid_BEFORE_CALL_56| |v_#valid_BEFORE_CALL_57|))) (store |v_#valid_BEFORE_CALL_56| .cse18 (select |v_#valid_BEFORE_CALL_57| .cse18)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse17) 1) (exists ((v_arrayElimIndex_21 Int)) (and (not (= .cse17 v_arrayElimIndex_21)) (= (select |v_#valid_BEFORE_CALL_57| v_arrayElimIndex_21) 1))))))))) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse19) 0)))))))) is different from true [2024-11-28 04:58:50,528 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse22 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|)) (.cse1 (select .cse22 |c_ULTIMATE.start_dll_append_~head#1.offset|))) (and (= (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select .cse0 0) 0) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (v_DerPreprocessor_44 Int) (v_prenex_56 Int) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (v_prenex_55 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse6 (store (store |v_#memory_$Pointer$#2.base_294| .cse4 v_DerPreprocessor_45) v_DerPreprocessor_44 v_DerPreprocessor_46))) (let ((.cse5 (select (select .cse6 .cse4) 4))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse7 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse5) 4))) (and (= |v_#valid_BEFORE_CALL_57| (let ((.cse2 (@diff v_prenex_55 |v_#valid_BEFORE_CALL_57|))) (store v_prenex_55 .cse2 (select |v_#valid_BEFORE_CALL_57| .cse2)))) (= .cse3 .cse4) (= (store (select |v_#memory_$Pointer$#2.base_294| .cse5) 8 (select (select .cse6 .cse5) 8)) v_DerPreprocessor_46) (= v_DerPreprocessor_44 .cse5) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3 (select |v_#memory_$Pointer$#2.base_294| .cse3))) (= (select v_prenex_55 .cse5) 1) (= .cse5 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse7) (+ v_prenex_56 8))) (= (select v_prenex_55 .cse4) 0) (= (select v_prenex_55 .cse7) 1)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse4) 1)))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((v_arrayElimIndex_20 Int) (|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| v_arrayElimIndex_20) 1) (= (select |v_#valid_BEFORE_CALL_56| .cse8) 0) (= |v_#valid_BEFORE_CALL_57| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_56| |v_#valid_BEFORE_CALL_57|))) (store |v_#valid_BEFORE_CALL_56| .cse9 (select |v_#valid_BEFORE_CALL_57| .cse9)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse8) 1) (exists ((v_arrayElimIndex_21 Int)) (and (not (= .cse8 v_arrayElimIndex_21)) (= (select |v_#valid_BEFORE_CALL_57| v_arrayElimIndex_21) 1))))))))) (let ((.cse12 (select .cse22 0))) (let ((.cse10 (= (select (select |c_#memory_$Pointer$#2.offset| .cse12) 4) 0)) (.cse15 (select |c_#memory_$Pointer$#2.base| .cse12))) (or (let ((.cse11 (select .cse15 4))) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| .cse11) 4))) (and (or .cse10 (= .cse11 .cse12)) (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (v_prenex_61 (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_61| .cse11) 1) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= (select v_prenex_61 .cse12) 0) (= (select |v_old(#valid)_AFTER_CALL_61| .cse12) 1) (= (select v_prenex_61 .cse13) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1)) (= (let ((.cse14 (@diff v_prenex_61 |v_old(#valid)_AFTER_CALL_61|))) (store v_prenex_61 .cse14 (select |v_old(#valid)_AFTER_CALL_61| .cse14))) |v_old(#valid)_AFTER_CALL_61|))) (or (exists ((v_prenex_62 Int)) (= .cse11 (select (select |c_#memory_$Pointer$#2.base| .cse13) (+ v_prenex_62 8)))) (= .cse11 .cse13))))) (and .cse10 (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (|node_create_~temp~0#1.base| Int) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_#valid_BEFORE_CALL_56| (Array Int Int)) (v_DerPreprocessor_51 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_51))) (let ((.cse19 (store (store |v_#memory_$Pointer$#2.base_294| .cse12 .cse15) v_DerPreprocessor_51 .cse20))) (let ((.cse16 (select (select .cse19 .cse12) 4))) (let ((.cse17 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse18 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse16) 4))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse16) 1) (= v_DerPreprocessor_51 .cse16) (= .cse17 .cse12) (= .cse16 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse18) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8))) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse17 (select |v_#memory_$Pointer$#2.base_294| .cse17))) (= |c_#memory_$Pointer$#2.base| (store .cse19 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|))) (= (select |v_#valid_BEFORE_CALL_56| .cse12) 0) (= (store (select |v_#memory_$Pointer$#2.base_294| .cse16) 8 (select (select .cse19 .cse16) 8)) .cse20) (= (select |v_#valid_BEFORE_CALL_56| .cse18) 1) (= (select |v_old(#valid)_AFTER_CALL_61| .cse12) 1) (= (let ((.cse21 (@diff |v_#valid_BEFORE_CALL_56| |v_old(#valid)_AFTER_CALL_61|))) (store |v_#valid_BEFORE_CALL_56| .cse21 (select |v_old(#valid)_AFTER_CALL_61| .cse21))) |v_old(#valid)_AFTER_CALL_61|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1)))))))))))) (let ((.cse23 (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) 4))) (or (= .cse23 .cse1) (= (select |c_#valid| .cse23) 1))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2024-11-28 04:58:50,542 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse22 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|)) (.cse1 (select .cse22 |c_ULTIMATE.start_dll_append_~head#1.offset|))) (and (= (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select .cse0 0) 0) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (v_DerPreprocessor_44 Int) (v_prenex_56 Int) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (v_prenex_55 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse6 (store (store |v_#memory_$Pointer$#2.base_294| .cse4 v_DerPreprocessor_45) v_DerPreprocessor_44 v_DerPreprocessor_46))) (let ((.cse5 (select (select .cse6 .cse4) 4))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse7 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse5) 4))) (and (= |v_#valid_BEFORE_CALL_57| (let ((.cse2 (@diff v_prenex_55 |v_#valid_BEFORE_CALL_57|))) (store v_prenex_55 .cse2 (select |v_#valid_BEFORE_CALL_57| .cse2)))) (= .cse3 .cse4) (= (store (select |v_#memory_$Pointer$#2.base_294| .cse5) 8 (select (select .cse6 .cse5) 8)) v_DerPreprocessor_46) (= v_DerPreprocessor_44 .cse5) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse3 (select |v_#memory_$Pointer$#2.base_294| .cse3))) (= (select v_prenex_55 .cse5) 1) (= .cse5 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse7) (+ v_prenex_56 8))) (= (select v_prenex_55 .cse4) 0) (= (select v_prenex_55 .cse7) 1)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse4) 1)))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_57| (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_12|) 0))) (and (exists ((v_arrayElimIndex_20 Int) (|v_#valid_BEFORE_CALL_56| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_56| v_arrayElimIndex_20) 1) (= (select |v_#valid_BEFORE_CALL_56| .cse8) 0) (= |v_#valid_BEFORE_CALL_57| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_56| |v_#valid_BEFORE_CALL_57|))) (store |v_#valid_BEFORE_CALL_56| .cse9 (select |v_#valid_BEFORE_CALL_57| .cse9)))))) (= (select |v_#valid_BEFORE_CALL_57| .cse8) 1) (exists ((v_arrayElimIndex_21 Int)) (and (not (= .cse8 v_arrayElimIndex_21)) (= (select |v_#valid_BEFORE_CALL_57| v_arrayElimIndex_21) 1))))))))) (let ((.cse12 (select .cse22 0))) (let ((.cse10 (= (select (select |c_#memory_$Pointer$#2.offset| .cse12) 4) 0)) (.cse15 (select |c_#memory_$Pointer$#2.base| .cse12))) (or (let ((.cse11 (select .cse15 4))) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| .cse11) 4))) (and (or .cse10 (= .cse11 .cse12)) (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (v_prenex_61 (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_61| .cse11) 1) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= (select v_prenex_61 .cse12) 0) (= (select |v_old(#valid)_AFTER_CALL_61| .cse12) 1) (= (select v_prenex_61 .cse13) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1)) (= (let ((.cse14 (@diff v_prenex_61 |v_old(#valid)_AFTER_CALL_61|))) (store v_prenex_61 .cse14 (select |v_old(#valid)_AFTER_CALL_61| .cse14))) |v_old(#valid)_AFTER_CALL_61|))) (or (exists ((v_prenex_62 Int)) (= .cse11 (select (select |c_#memory_$Pointer$#2.base| .cse13) (+ v_prenex_62 8)))) (= .cse11 .cse13))))) (and .cse10 (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (|v_#memory_$Pointer$#2.base_294| (Array Int (Array Int Int))) (|node_create_~temp~0#1.base| Int) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_#valid_BEFORE_CALL_56| (Array Int Int)) (v_DerPreprocessor_51 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_51))) (let ((.cse19 (store (store |v_#memory_$Pointer$#2.base_294| .cse12 .cse15) v_DerPreprocessor_51 .cse20))) (let ((.cse16 (select (select .cse19 .cse12) 4))) (let ((.cse17 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| |v_#memory_$Pointer$#2.base_294|)) (.cse18 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse16) 4))) (and (= (select |v_#valid_BEFORE_CALL_56| .cse16) 1) (= v_DerPreprocessor_51 .cse16) (= .cse17 .cse12) (= .cse16 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse18) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8))) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= |v_#memory_$Pointer$#2.base_294| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_60| .cse17 (select |v_#memory_$Pointer$#2.base_294| .cse17))) (= |c_#memory_$Pointer$#2.base| (store .cse19 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|))) (= (select |v_#valid_BEFORE_CALL_56| .cse12) 0) (= (store (select |v_#memory_$Pointer$#2.base_294| .cse16) 8 (select (select .cse19 .cse16) 8)) .cse20) (= (select |v_#valid_BEFORE_CALL_56| .cse18) 1) (= (select |v_old(#valid)_AFTER_CALL_61| .cse12) 1) (= (let ((.cse21 (@diff |v_#valid_BEFORE_CALL_56| |v_old(#valid)_AFTER_CALL_61|))) (store |v_#valid_BEFORE_CALL_56| .cse21 (select |v_old(#valid)_AFTER_CALL_61| .cse21))) |v_old(#valid)_AFTER_CALL_61|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1)))))))))))) (let ((.cse23 (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) 4))) (or (= .cse23 .cse1) (= (select |c_#valid| .cse23) 1))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2024-11-28 04:58:50,572 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|))) (let ((.cse9 (select .cse7 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse9) 4)) (.cse8 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 4) 0))) (and (or (= .cse0 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (= (select |c_#valid| .cse0) 1)) (= |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 0) (or (and (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (v_prenex_70 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_69 (Array Int (Array Int Int))) (v_prenex_68 (Array Int (Array Int Int))) (v_DerPreprocessor_51 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_51))) (let ((.cse2 (store (store v_prenex_68 |c_ULTIMATE.start_dll_append_#t~mem9#1.base| .cse7) v_DerPreprocessor_51 .cse3))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 4))) (let ((.cse4 (@diff v_prenex_69 v_prenex_68)) (.cse6 (select (select v_prenex_69 .cse1) 4))) (and (= (store (select v_prenex_68 .cse1) 8 (select (select .cse2 .cse1) 8)) .cse3) (= (store v_prenex_69 .cse4 (select v_prenex_68 .cse4)) v_prenex_68) (= (let ((.cse5 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_61|))) (store v_prenex_70 .cse5 (select |v_old(#valid)_AFTER_CALL_61| .cse5))) |v_old(#valid)_AFTER_CALL_61|) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= (select v_prenex_70 .cse1) 1) (= .cse4 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (= |c_#memory_$Pointer$#2.base| (store .cse2 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|))) (= (select v_prenex_70 .cse6) 1) (= .cse1 v_DerPreprocessor_51) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1)) (= (select v_prenex_70 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 0) (= .cse1 (select (select v_prenex_69 .cse6) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8))) (= (select |v_old(#valid)_AFTER_CALL_61| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 1))))))) .cse8) (and (or (= .cse9 .cse0) (exists ((v_prenex_62 Int)) (= .cse9 (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ v_prenex_62 8))))) (or (= .cse9 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse8) (exists ((v_prenex_61 (Array Int Int)) (v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (= (select v_prenex_61 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 0) (= (select v_prenex_66 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 1) (= (select v_prenex_66 .cse9) 1) (= v_prenex_66 (let ((.cse10 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse10 (select v_prenex_66 .cse10)))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_61 .cse0) 1) (= (select v_prenex_66 v_prenex_67) 0))))) .cse8)))) is different from false [2024-11-28 04:58:50,582 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|))) (let ((.cse9 (select .cse7 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse9) 4)) (.cse8 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 4) 0))) (and (or (= .cse0 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (= (select |c_#valid| .cse0) 1)) (= |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 0) (or (and (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (v_prenex_70 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_69 (Array Int (Array Int Int))) (v_prenex_68 (Array Int (Array Int Int))) (v_DerPreprocessor_51 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_51))) (let ((.cse2 (store (store v_prenex_68 |c_ULTIMATE.start_dll_append_#t~mem9#1.base| .cse7) v_DerPreprocessor_51 .cse3))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 4))) (let ((.cse4 (@diff v_prenex_69 v_prenex_68)) (.cse6 (select (select v_prenex_69 .cse1) 4))) (and (= (store (select v_prenex_68 .cse1) 8 (select (select .cse2 .cse1) 8)) .cse3) (= (store v_prenex_69 .cse4 (select v_prenex_68 .cse4)) v_prenex_68) (= (let ((.cse5 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_61|))) (store v_prenex_70 .cse5 (select |v_old(#valid)_AFTER_CALL_61| .cse5))) |v_old(#valid)_AFTER_CALL_61|) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= (select v_prenex_70 .cse1) 1) (= .cse4 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (= |c_#memory_$Pointer$#2.base| (store .cse2 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|))) (= (select v_prenex_70 .cse6) 1) (= .cse1 v_DerPreprocessor_51) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1)) (= (select v_prenex_70 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 0) (= .cse1 (select (select v_prenex_69 .cse6) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8))) (= (select |v_old(#valid)_AFTER_CALL_61| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 1))))))) .cse8) (and (or (= .cse9 .cse0) (exists ((v_prenex_62 Int)) (= .cse9 (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ v_prenex_62 8))))) (or (= .cse9 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse8) (exists ((v_prenex_61 (Array Int Int)) (v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (= (select v_prenex_61 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 0) (= (select v_prenex_66 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 1) (= (select v_prenex_66 .cse9) 1) (= v_prenex_66 (let ((.cse10 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse10 (select v_prenex_66 .cse10)))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_61 .cse0) 1) (= (select v_prenex_66 v_prenex_67) 0))))) .cse8)))) is different from true [2024-11-28 04:58:50,613 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (let ((.cse9 (select .cse7 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse9) 4)) (.cse8 (= 0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)))) (and (or (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (= (select |c_#valid| .cse0) 1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (and (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (v_prenex_70 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_69 (Array Int (Array Int Int))) (v_prenex_68 (Array Int (Array Int Int))) (v_DerPreprocessor_51 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_51))) (let ((.cse3 (store (store v_prenex_68 |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse7) v_DerPreprocessor_51 .cse1))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse4 (@diff v_prenex_69 v_prenex_68)) (.cse6 (select (select v_prenex_69 .cse2) 4))) (and (= .cse1 (store (select v_prenex_68 .cse2) 8 (select (select .cse3 .cse2) 8))) (= (store v_prenex_69 .cse4 (select v_prenex_68 .cse4)) v_prenex_68) (= (let ((.cse5 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_61|))) (store v_prenex_70 .cse5 (select |v_old(#valid)_AFTER_CALL_61| .cse5))) |v_old(#valid)_AFTER_CALL_61|) (= (select v_prenex_70 .cse2) 1) (= (select v_prenex_70 .cse6) 1) (= 0 (select v_prenex_70 |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (= v_DerPreprocessor_51 .cse2) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4) (= (select |v_old(#valid)_AFTER_CALL_61| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (select (select v_prenex_69 .cse6) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse2) (= (store .cse3 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1)))))))) .cse8) (and (or (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse9) .cse8) (exists ((v_prenex_61 (Array Int Int)) (v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (= (select v_prenex_66 .cse9) 1) (= (select v_prenex_61 .cse0) 1) (= (select v_prenex_61 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= v_prenex_66 (let ((.cse10 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse10 (select v_prenex_66 .cse10)))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_66 v_prenex_67) 0) (= (select v_prenex_66 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1))) (or (= .cse0 .cse9) (exists ((v_prenex_62 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ v_prenex_62 8)) .cse9))))) .cse8)))) is different from false [2024-11-28 04:58:50,628 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (let ((.cse9 (select .cse7 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse9) 4)) (.cse8 (= 0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)))) (and (or (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (= (select |c_#valid| .cse0) 1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (and (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (v_prenex_70 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_69 (Array Int (Array Int Int))) (v_prenex_68 (Array Int (Array Int Int))) (v_DerPreprocessor_51 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_51))) (let ((.cse3 (store (store v_prenex_68 |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse7) v_DerPreprocessor_51 .cse1))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse4 (@diff v_prenex_69 v_prenex_68)) (.cse6 (select (select v_prenex_69 .cse2) 4))) (and (= .cse1 (store (select v_prenex_68 .cse2) 8 (select (select .cse3 .cse2) 8))) (= (store v_prenex_69 .cse4 (select v_prenex_68 .cse4)) v_prenex_68) (= (let ((.cse5 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_61|))) (store v_prenex_70 .cse5 (select |v_old(#valid)_AFTER_CALL_61| .cse5))) |v_old(#valid)_AFTER_CALL_61|) (= (select v_prenex_70 .cse2) 1) (= (select v_prenex_70 .cse6) 1) (= 0 (select v_prenex_70 |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (= v_DerPreprocessor_51 .cse2) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4) (= (select |v_old(#valid)_AFTER_CALL_61| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (select (select v_prenex_69 .cse6) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse2) (= (store .cse3 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1)))))))) .cse8) (and (or (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse9) .cse8) (exists ((v_prenex_61 (Array Int Int)) (v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (= (select v_prenex_66 .cse9) 1) (= (select v_prenex_61 .cse0) 1) (= (select v_prenex_61 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= v_prenex_66 (let ((.cse10 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse10 (select v_prenex_66 .cse10)))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_66 v_prenex_67) 0) (= (select v_prenex_66 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1))) (or (= .cse0 .cse9) (exists ((v_prenex_62 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ v_prenex_62 8)) .cse9))))) .cse8)))) is different from true [2024-11-28 04:58:50,682 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (let ((.cse9 (select .cse7 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse9) 4)) (.cse8 (= 0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)))) (and (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (and (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (v_prenex_70 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_69 (Array Int (Array Int Int))) (v_prenex_68 (Array Int (Array Int Int))) (v_DerPreprocessor_51 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_51))) (let ((.cse3 (store (store v_prenex_68 |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse7) v_DerPreprocessor_51 .cse1))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse4 (@diff v_prenex_69 v_prenex_68)) (.cse6 (select (select v_prenex_69 .cse2) 4))) (and (= .cse1 (store (select v_prenex_68 .cse2) 8 (select (select .cse3 .cse2) 8))) (= (store v_prenex_69 .cse4 (select v_prenex_68 .cse4)) v_prenex_68) (= (let ((.cse5 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_61|))) (store v_prenex_70 .cse5 (select |v_old(#valid)_AFTER_CALL_61| .cse5))) |v_old(#valid)_AFTER_CALL_61|) (= (select v_prenex_70 .cse2) 1) (= (select v_prenex_70 .cse6) 1) (= 0 (select v_prenex_70 |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (= v_DerPreprocessor_51 .cse2) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4) (= (select |v_old(#valid)_AFTER_CALL_61| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (select (select v_prenex_69 .cse6) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse2) (= (store .cse3 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1)))))))) .cse8) (and (or (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse9) .cse8) (exists ((v_prenex_61 (Array Int Int)) (v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (= (select v_prenex_66 .cse9) 1) (= (select v_prenex_61 .cse0) 1) (= (select v_prenex_61 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= v_prenex_66 (let ((.cse10 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse10 (select v_prenex_66 .cse10)))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_66 v_prenex_67) 0) (= (select v_prenex_66 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1))) (or (= .cse0 .cse9) (exists ((v_prenex_62 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ v_prenex_62 8)) .cse9))))) .cse8)))) is different from false [2024-11-28 04:58:50,698 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (let ((.cse9 (select .cse7 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse9) 4)) (.cse8 (= 0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)))) (and (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (and (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (v_prenex_70 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_69 (Array Int (Array Int Int))) (v_prenex_68 (Array Int (Array Int Int))) (v_DerPreprocessor_51 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_51))) (let ((.cse3 (store (store v_prenex_68 |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse7) v_DerPreprocessor_51 .cse1))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse4 (@diff v_prenex_69 v_prenex_68)) (.cse6 (select (select v_prenex_69 .cse2) 4))) (and (= .cse1 (store (select v_prenex_68 .cse2) 8 (select (select .cse3 .cse2) 8))) (= (store v_prenex_69 .cse4 (select v_prenex_68 .cse4)) v_prenex_68) (= (let ((.cse5 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_61|))) (store v_prenex_70 .cse5 (select |v_old(#valid)_AFTER_CALL_61| .cse5))) |v_old(#valid)_AFTER_CALL_61|) (= (select v_prenex_70 .cse2) 1) (= (select v_prenex_70 .cse6) 1) (= 0 (select v_prenex_70 |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (= v_DerPreprocessor_51 .cse2) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4) (= (select |v_old(#valid)_AFTER_CALL_61| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (select (select v_prenex_69 .cse6) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse2) (= (store .cse3 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1)))))))) .cse8) (and (or (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse9) .cse8) (exists ((v_prenex_61 (Array Int Int)) (v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (= (select v_prenex_66 .cse9) 1) (= (select v_prenex_61 .cse0) 1) (= (select v_prenex_61 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= v_prenex_66 (let ((.cse10 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse10 (select v_prenex_66 .cse10)))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_66 v_prenex_67) 0) (= (select v_prenex_66 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1))) (or (= .cse0 .cse9) (exists ((v_prenex_62 Int)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ v_prenex_62 8)) .cse9))))) .cse8)))) is different from true [2024-11-28 04:58:50,820 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_append_#t~mem11#1.offset| 0))) (and .cse0 (= 1 (select |c_#valid| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 4))) (or (and (or (exists ((v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_66 v_prenex_67) 0) (exists ((v_prenex_61 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_63| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= .cse1 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= (select v_prenex_66 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 1) (exists ((v_prenex_62 Int)) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) (+ v_prenex_62 8)))) (= (select v_prenex_66 .cse1) 1) (= (select v_prenex_61 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 0) (= (select v_prenex_61 .cse2) 1))))) (= v_prenex_66 (let ((.cse3 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse3 (select v_prenex_66 .cse3)))))))) (exists ((v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (exists ((v_prenex_61 (Array Int Int))) (and (= v_prenex_66 (let ((.cse4 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse4 (select v_prenex_66 .cse4)))) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_63| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4))) (and (= .cse5 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= (select v_prenex_66 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 1) (= (select v_prenex_61 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 0) (= .cse5 .cse6) (= (select v_prenex_61 .cse6) 1))))))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_66 v_prenex_67) 0)))) .cse0) (and (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (v_prenex_70 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_69 (Array Int (Array Int Int))) (v_prenex_68 (Array Int (Array Int Int))) (v_DerPreprocessor_51 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse10 (@diff v_prenex_69 v_prenex_68))) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| .cse10)) (.cse9 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_51))) (let ((.cse8 (store (store v_prenex_68 .cse10 .cse13) v_DerPreprocessor_51 .cse9))) (let ((.cse7 (select (select .cse8 .cse10) 4))) (let ((.cse12 (select (select v_prenex_69 .cse7) 4))) (and (= (store (select v_prenex_68 .cse7) 8 (select (select .cse8 .cse7) 8)) .cse9) (= (store .cse8 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (select v_prenex_70 .cse7) 1) (= (store v_prenex_69 .cse10 (select v_prenex_68 .cse10)) v_prenex_68) (= (let ((.cse11 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_61|))) (store v_prenex_70 .cse11 (select |v_old(#valid)_AFTER_CALL_61| .cse11))) |v_old(#valid)_AFTER_CALL_61|) (= (select v_prenex_70 .cse10) 0) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_61| .cse10) 1) (= (select (select v_prenex_69 .cse12) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse7) (= (select .cse13 4) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= v_DerPreprocessor_51 .cse7) (= (select v_prenex_70 .cse12) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1))))))))) .cse0)))) is different from false [2024-11-28 04:58:50,835 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_append_#t~mem11#1.offset| 0))) (and .cse0 (= 1 (select |c_#valid| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 4))) (or (and (or (exists ((v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_66 v_prenex_67) 0) (exists ((v_prenex_61 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_63| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= .cse1 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= (select v_prenex_66 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 1) (exists ((v_prenex_62 Int)) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) (+ v_prenex_62 8)))) (= (select v_prenex_66 .cse1) 1) (= (select v_prenex_61 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 0) (= (select v_prenex_61 .cse2) 1))))) (= v_prenex_66 (let ((.cse3 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse3 (select v_prenex_66 .cse3)))))))) (exists ((v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (exists ((v_prenex_61 (Array Int Int))) (and (= v_prenex_66 (let ((.cse4 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse4 (select v_prenex_66 .cse4)))) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_63| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4))) (and (= .cse5 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= (select v_prenex_66 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 1) (= (select v_prenex_61 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 0) (= .cse5 .cse6) (= (select v_prenex_61 .cse6) 1))))))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_66 v_prenex_67) 0)))) .cse0) (and (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (v_prenex_70 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_69 (Array Int (Array Int Int))) (v_prenex_68 (Array Int (Array Int Int))) (v_DerPreprocessor_51 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse10 (@diff v_prenex_69 v_prenex_68))) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| .cse10)) (.cse9 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_51))) (let ((.cse8 (store (store v_prenex_68 .cse10 .cse13) v_DerPreprocessor_51 .cse9))) (let ((.cse7 (select (select .cse8 .cse10) 4))) (let ((.cse12 (select (select v_prenex_69 .cse7) 4))) (and (= (store (select v_prenex_68 .cse7) 8 (select (select .cse8 .cse7) 8)) .cse9) (= (store .cse8 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (select v_prenex_70 .cse7) 1) (= (store v_prenex_69 .cse10 (select v_prenex_68 .cse10)) v_prenex_68) (= (let ((.cse11 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_61|))) (store v_prenex_70 .cse11 (select |v_old(#valid)_AFTER_CALL_61| .cse11))) |v_old(#valid)_AFTER_CALL_61|) (= (select v_prenex_70 .cse10) 0) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_61| .cse10) 1) (= (select (select v_prenex_69 .cse12) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse7) (= (select .cse13 4) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= v_DerPreprocessor_51 .cse7) (= (select v_prenex_70 .cse12) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1))))))))) .cse0)))) is different from true [2024-11-28 04:58:50,933 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0))) (and .cse0 (or (and .cse0 (or (exists ((v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (exists ((v_prenex_61 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_63| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select v_prenex_66 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 1) (exists ((v_prenex_62 Int)) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) (+ v_prenex_62 8)))) (= (select v_prenex_66 .cse1) 1) (= .cse1 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select v_prenex_61 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 0) (= (select v_prenex_61 .cse2) 1))))) (= v_prenex_66 (let ((.cse3 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse3 (select v_prenex_66 .cse3)))))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_66 v_prenex_67) 0))) (exists ((v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (exists ((v_prenex_61 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_63| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4))) (and (= (select v_prenex_66 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 1) (= .cse4 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select v_prenex_61 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 0) (= .cse4 .cse5) (= (select v_prenex_61 .cse5) 1))))) (= v_prenex_66 (let ((.cse6 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse6 (select v_prenex_66 .cse6)))))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_66 v_prenex_67) 0))))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (v_prenex_70 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_69 (Array Int (Array Int Int))) (v_prenex_68 (Array Int (Array Int Int))) (v_DerPreprocessor_51 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse10 (@diff v_prenex_69 v_prenex_68))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse10)) (.cse9 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_51))) (let ((.cse8 (store (store v_prenex_68 .cse10 .cse12) v_DerPreprocessor_51 .cse9))) (let ((.cse7 (select (select .cse8 .cse10) 4))) (let ((.cse13 (select (select v_prenex_69 .cse7) 4))) (and (= (store (select v_prenex_68 .cse7) 8 (select (select .cse8 .cse7) 8)) .cse9) (= (store .cse8 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (select v_prenex_70 .cse7) 1) (= (store v_prenex_69 .cse10 (select v_prenex_68 .cse10)) v_prenex_68) (= (let ((.cse11 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_61|))) (store v_prenex_70 .cse11 (select |v_old(#valid)_AFTER_CALL_61| .cse11))) |v_old(#valid)_AFTER_CALL_61|) (= (select .cse12 4) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select v_prenex_70 .cse10) 0) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_61| .cse10) 1) (= (select (select v_prenex_69 .cse13) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse7) (= v_DerPreprocessor_51 .cse7) (= (select v_prenex_70 .cse13) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1))))))))))) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) 1))) is different from false [2024-11-28 04:58:50,944 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0))) (and .cse0 (or (and .cse0 (or (exists ((v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (exists ((v_prenex_61 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_63| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select v_prenex_66 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 1) (exists ((v_prenex_62 Int)) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) (+ v_prenex_62 8)))) (= (select v_prenex_66 .cse1) 1) (= .cse1 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select v_prenex_61 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 0) (= (select v_prenex_61 .cse2) 1))))) (= v_prenex_66 (let ((.cse3 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse3 (select v_prenex_66 .cse3)))))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_66 v_prenex_67) 0))) (exists ((v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (exists ((v_prenex_61 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_63| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4))) (and (= (select v_prenex_66 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 1) (= .cse4 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select v_prenex_61 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 0) (= .cse4 .cse5) (= (select v_prenex_61 .cse5) 1))))) (= v_prenex_66 (let ((.cse6 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse6 (select v_prenex_66 .cse6)))))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_66 v_prenex_67) 0))))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (v_prenex_70 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_69 (Array Int (Array Int Int))) (v_prenex_68 (Array Int (Array Int Int))) (v_DerPreprocessor_51 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse10 (@diff v_prenex_69 v_prenex_68))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse10)) (.cse9 (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_51))) (let ((.cse8 (store (store v_prenex_68 .cse10 .cse12) v_DerPreprocessor_51 .cse9))) (let ((.cse7 (select (select .cse8 .cse10) 4))) (let ((.cse13 (select (select v_prenex_69 .cse7) 4))) (and (= (store (select v_prenex_68 .cse7) 8 (select (select .cse8 .cse7) 8)) .cse9) (= (store .cse8 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (select v_prenex_70 .cse7) 1) (= (store v_prenex_69 .cse10 (select v_prenex_68 .cse10)) v_prenex_68) (= (let ((.cse11 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_61|))) (store v_prenex_70 .cse11 (select |v_old(#valid)_AFTER_CALL_61| .cse11))) |v_old(#valid)_AFTER_CALL_61|) (= (select .cse12 4) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select v_prenex_70 .cse10) 0) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_61| .cse10) 1) (= (select (select v_prenex_69 .cse13) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse7) (= v_DerPreprocessor_51 .cse7) (= (select v_prenex_70 .cse13) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1))))))))))) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) 1))) is different from true [2024-11-28 04:58:51,014 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (v_prenex_70 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_69 (Array Int (Array Int Int))) (v_prenex_68 (Array Int (Array Int Int))) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int)) (v_DerPreprocessor_51 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse0 (@diff v_prenex_69 v_prenex_68))) (let ((.cse4 (store (store (store v_prenex_68 .cse0 v_DerPreprocessor_54) v_DerPreprocessor_51 v_DerPreprocessor_55) |node_create_~temp~0#1.base| v_DerPreprocessor_56))) (let ((.cse5 (select .cse4 .cse0)) (.cse7 (select .cse4 v_DerPreprocessor_51))) (let ((.cse6 (store (store v_prenex_68 .cse0 .cse5) v_DerPreprocessor_51 .cse7))) (let ((.cse2 (select (select .cse6 .cse0) 4))) (let ((.cse3 (select (select v_prenex_69 .cse2) 4))) (and (= (store v_prenex_69 .cse0 (select v_prenex_68 .cse0)) v_prenex_68) (= (let ((.cse1 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_61|))) (store v_prenex_70 .cse1 (select |v_old(#valid)_AFTER_CALL_61| .cse1))) |v_old(#valid)_AFTER_CALL_61|) (= (select v_prenex_70 .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_61| .cse0) 1) (= (select v_prenex_70 .cse2) 1) (= .cse2 v_DerPreprocessor_51) (= (select v_prenex_70 .cse3) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1)) (= (select (select v_prenex_69 .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse2) (= (select (select .cse4 (select .cse5 4)) 4) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= (store (select v_prenex_68 .cse2) 8 (select (select .cse6 .cse2) 8)) .cse7))))))))) (exists ((v_prenex_61 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_63| Int) (v_prenex_67 Int) (v_prenex_66 (Array Int Int)) (v_arrayElimCell_279 Int)) (and (= (select v_prenex_61 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1) (= (select v_prenex_66 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 1) (= v_prenex_66 (let ((.cse8 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse8 (select v_prenex_66 .cse8)))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_61 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 0) (= (select v_prenex_66 v_prenex_67) 0) (not (= |v_ULTIMATE.start_dll_append_~last~0#1.base_63| v_arrayElimCell_279)) (= (select v_prenex_66 v_arrayElimCell_279) 1))) (exists ((v_prenex_61 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_63| Int) (v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (= (select v_prenex_61 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1) (= (select v_prenex_66 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 1) (= v_prenex_66 (let ((.cse9 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse9 (select v_prenex_66 .cse9)))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_61 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 0) (= (select v_prenex_66 v_prenex_67) 0)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1)) is different from false [2024-11-28 04:58:51,024 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (v_prenex_70 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_69 (Array Int (Array Int Int))) (v_prenex_68 (Array Int (Array Int Int))) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int)) (v_DerPreprocessor_51 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse0 (@diff v_prenex_69 v_prenex_68))) (let ((.cse4 (store (store (store v_prenex_68 .cse0 v_DerPreprocessor_54) v_DerPreprocessor_51 v_DerPreprocessor_55) |node_create_~temp~0#1.base| v_DerPreprocessor_56))) (let ((.cse5 (select .cse4 .cse0)) (.cse7 (select .cse4 v_DerPreprocessor_51))) (let ((.cse6 (store (store v_prenex_68 .cse0 .cse5) v_DerPreprocessor_51 .cse7))) (let ((.cse2 (select (select .cse6 .cse0) 4))) (let ((.cse3 (select (select v_prenex_69 .cse2) 4))) (and (= (store v_prenex_69 .cse0 (select v_prenex_68 .cse0)) v_prenex_68) (= (let ((.cse1 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_61|))) (store v_prenex_70 .cse1 (select |v_old(#valid)_AFTER_CALL_61| .cse1))) |v_old(#valid)_AFTER_CALL_61|) (= (select v_prenex_70 .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_61| .cse0) 1) (= (select v_prenex_70 .cse2) 1) (= .cse2 v_DerPreprocessor_51) (= (select v_prenex_70 .cse3) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1)) (= (select (select v_prenex_69 .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse2) (= (select (select .cse4 (select .cse5 4)) 4) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= (store (select v_prenex_68 .cse2) 8 (select (select .cse6 .cse2) 8)) .cse7))))))))) (exists ((v_prenex_61 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_63| Int) (v_prenex_67 Int) (v_prenex_66 (Array Int Int)) (v_arrayElimCell_279 Int)) (and (= (select v_prenex_61 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1) (= (select v_prenex_66 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 1) (= v_prenex_66 (let ((.cse8 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse8 (select v_prenex_66 .cse8)))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_61 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 0) (= (select v_prenex_66 v_prenex_67) 0) (not (= |v_ULTIMATE.start_dll_append_~last~0#1.base_63| v_arrayElimCell_279)) (= (select v_prenex_66 v_arrayElimCell_279) 1))) (exists ((v_prenex_61 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_63| Int) (v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (= (select v_prenex_61 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1) (= (select v_prenex_66 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 1) (= v_prenex_66 (let ((.cse9 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse9 (select v_prenex_66 .cse9)))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_61 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 0) (= (select v_prenex_66 v_prenex_67) 0)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1)) is different from true [2024-11-28 04:58:51,095 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((v_prenex_61 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_63| Int) (v_prenex_67 Int) (v_prenex_66 (Array Int Int)) (v_arrayElimCell_279 Int)) (and (= (select v_prenex_66 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 1) (= (select v_prenex_61 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= v_prenex_66 (let ((.cse0 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse0 (select v_prenex_66 .cse0)))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_61 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 0) (= (select v_prenex_66 v_prenex_67) 0) (not (= |v_ULTIMATE.start_dll_append_~last~0#1.base_63| v_arrayElimCell_279)) (= (select v_prenex_66 v_arrayElimCell_279) 1))) (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (v_prenex_70 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_69 (Array Int (Array Int Int))) (v_prenex_68 (Array Int (Array Int Int))) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int)) (v_DerPreprocessor_51 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse1 (@diff v_prenex_69 v_prenex_68))) (let ((.cse2 (store (store (store v_prenex_68 .cse1 v_DerPreprocessor_54) v_DerPreprocessor_51 v_DerPreprocessor_55) |node_create_~temp~0#1.base| v_DerPreprocessor_56))) (let ((.cse3 (select .cse2 .cse1)) (.cse8 (select .cse2 v_DerPreprocessor_51))) (let ((.cse7 (store (store v_prenex_68 .cse1 .cse3) v_DerPreprocessor_51 .cse8))) (let ((.cse5 (select (select .cse7 .cse1) 4))) (let ((.cse6 (select (select v_prenex_69 .cse5) 4))) (and (= (store v_prenex_69 .cse1 (select v_prenex_68 .cse1)) v_prenex_68) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select .cse2 (select .cse3 4)) 4)) (= (let ((.cse4 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_61|))) (store v_prenex_70 .cse4 (select |v_old(#valid)_AFTER_CALL_61| .cse4))) |v_old(#valid)_AFTER_CALL_61|) (= (select v_prenex_70 .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_61| .cse1) 1) (= (select v_prenex_70 .cse5) 1) (= .cse5 v_DerPreprocessor_51) (= (select v_prenex_70 .cse6) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1)) (= (select (select v_prenex_69 .cse6) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse5) (= (store (select v_prenex_68 .cse5) 8 (select (select .cse7 .cse5) 8)) .cse8))))))))) (exists ((v_prenex_61 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_63| Int) (v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (= (select v_prenex_66 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 1) (= (select v_prenex_61 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= v_prenex_66 (let ((.cse9 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse9 (select v_prenex_66 .cse9)))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_61 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 0) (= (select v_prenex_66 v_prenex_67) 0)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1)) is different from false [2024-11-28 04:58:51,104 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_prenex_61 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_63| Int) (v_prenex_67 Int) (v_prenex_66 (Array Int Int)) (v_arrayElimCell_279 Int)) (and (= (select v_prenex_66 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 1) (= (select v_prenex_61 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= v_prenex_66 (let ((.cse0 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse0 (select v_prenex_66 .cse0)))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_61 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 0) (= (select v_prenex_66 v_prenex_67) 0) (not (= |v_ULTIMATE.start_dll_append_~last~0#1.base_63| v_arrayElimCell_279)) (= (select v_prenex_66 v_arrayElimCell_279) 1))) (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (v_prenex_70 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_69 (Array Int (Array Int Int))) (v_prenex_68 (Array Int (Array Int Int))) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int)) (v_DerPreprocessor_51 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_38| Int)) (let ((.cse1 (@diff v_prenex_69 v_prenex_68))) (let ((.cse2 (store (store (store v_prenex_68 .cse1 v_DerPreprocessor_54) v_DerPreprocessor_51 v_DerPreprocessor_55) |node_create_~temp~0#1.base| v_DerPreprocessor_56))) (let ((.cse3 (select .cse2 .cse1)) (.cse8 (select .cse2 v_DerPreprocessor_51))) (let ((.cse7 (store (store v_prenex_68 .cse1 .cse3) v_DerPreprocessor_51 .cse8))) (let ((.cse5 (select (select .cse7 .cse1) 4))) (let ((.cse6 (select (select v_prenex_69 .cse5) 4))) (and (= (store v_prenex_69 .cse1 (select v_prenex_68 .cse1)) v_prenex_68) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select .cse2 (select .cse3 4)) 4)) (= (let ((.cse4 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_61|))) (store v_prenex_70 .cse4 (select |v_old(#valid)_AFTER_CALL_61| .cse4))) |v_old(#valid)_AFTER_CALL_61|) (= (select v_prenex_70 .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_61| .cse1) 1) (= (select v_prenex_70 .cse5) 1) (= .cse5 v_DerPreprocessor_51) (= (select v_prenex_70 .cse6) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_61| |node_create_~temp~0#1.base| 1)) (= (select (select v_prenex_69 .cse6) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_38| 8)) .cse5) (= (store (select v_prenex_68 .cse5) 8 (select (select .cse7 .cse5) 8)) .cse8))))))))) (exists ((v_prenex_61 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_63| Int) (v_prenex_67 Int) (v_prenex_66 (Array Int Int))) (and (= (select v_prenex_66 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 1) (= (select v_prenex_61 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= v_prenex_66 (let ((.cse9 (@diff v_prenex_61 v_prenex_66))) (store v_prenex_61 .cse9 (select v_prenex_66 .cse9)))) (= |c_#valid| (store v_prenex_66 v_prenex_67 1)) (= (select v_prenex_61 |v_ULTIMATE.start_dll_append_~last~0#1.base_63|) 0) (= (select v_prenex_66 v_prenex_67) 0)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1)) is different from true [2024-11-28 04:58:51,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:58:51,344 INFO L93 Difference]: Finished difference Result 179 states and 195 transitions. [2024-11-28 04:58:51,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-28 04:58:51,345 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 60 states have (on average 2.0) internal successors, (120), 56 states have internal predecessors, (120), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 75 [2024-11-28 04:58:51,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:58:51,346 INFO L225 Difference]: With dead ends: 179 [2024-11-28 04:58:51,346 INFO L226 Difference]: Without dead ends: 179 [2024-11-28 04:58:51,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 41 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=271, Invalid=2781, Unknown=82, NotChecked=5986, Total=9120 [2024-11-28 04:58:51,348 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 42 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 5454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4316 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:58:51,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1199 Invalid, 5454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1127 Invalid, 0 Unknown, 4316 Unchecked, 3.0s Time] [2024-11-28 04:58:51,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-28 04:58:51,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 147. [2024-11-28 04:58:51,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 125 states have (on average 1.184) internal successors, (148), 138 states have internal predecessors, (148), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 04:58:51,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2024-11-28 04:58:51,356 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 75 [2024-11-28 04:58:51,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:58:51,356 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2024-11-28 04:58:51,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 60 states have (on average 2.0) internal successors, (120), 56 states have internal predecessors, (120), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-28 04:58:51,357 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2024-11-28 04:58:51,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 04:58:51,358 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:58:51,358 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:58:51,369 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-28 04:58:51,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:58:51,559 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:58:51,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:58:51,559 INFO L85 PathProgramCache]: Analyzing trace with hash 95303469, now seen corresponding path program 2 times [2024-11-28 04:58:51,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:58:51,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254370649] [2024-11-28 04:58:51,559 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:58:51,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:58:51,605 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:58:51,606 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:58:51,783 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-28 04:58:51,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:58:51,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254370649] [2024-11-28 04:58:51,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254370649] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:58:51,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369217877] [2024-11-28 04:58:51,784 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:58:51,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:58:51,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:58:51,787 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:58:51,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-28 04:58:52,252 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:58:52,252 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:58:52,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 04:58:52,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:58:52,350 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 04:58:52,350 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:58:52,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369217877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:58:52,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:58:52,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-11-28 04:58:52,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422066138] [2024-11-28 04:58:52,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:58:52,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:58:52,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:58:52,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:58:52,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:58:52,352 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 04:58:52,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:58:52,407 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2024-11-28 04:58:52,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:58:52,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 75 [2024-11-28 04:58:52,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:58:52,408 INFO L225 Difference]: With dead ends: 92 [2024-11-28 04:58:52,408 INFO L226 Difference]: Without dead ends: 92 [2024-11-28 04:58:52,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:58:52,409 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:58:52,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:58:52,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-28 04:58:52,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-28 04:58:52,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 77 states have (on average 1.155844155844156) internal successors, (89), 86 states have internal predecessors, (89), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:58:52,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2024-11-28 04:58:52,413 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 75 [2024-11-28 04:58:52,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:58:52,414 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2024-11-28 04:58:52,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 04:58:52,414 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2024-11-28 04:58:52,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 04:58:52,414 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:58:52,415 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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:58:52,424 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-11-28 04:58:52,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-11-28 04:58:52,615 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:58:52,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:58:52,616 INFO L85 PathProgramCache]: Analyzing trace with hash 2018161405, now seen corresponding path program 2 times [2024-11-28 04:58:52,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:58:52,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838243976] [2024-11-28 04:58:52,616 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:58:52,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:58:52,716 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:58:52,716 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:59:02,215 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 23 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:59:02,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:59:02,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838243976] [2024-11-28 04:59:02,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838243976] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:59:02,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266557212] [2024-11-28 04:59:02,216 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:59:02,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:59:02,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:59:02,218 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:59:02,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-28 04:59:02,824 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:59:02,824 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:59:02,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 157 conjuncts are in the unsatisfiable core [2024-11-28 04:59:02,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:59:04,913 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 04:59:04,914 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:59:05,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:59:05,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:59:06,102 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:59:06,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 04:59:06,124 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 30 treesize of output 13 [2024-11-28 04:59:07,386 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 42 treesize of output 14 [2024-11-28 04:59:07,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2024-11-28 04:59:07,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 04:59:07,714 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:59:08,945 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 04:59:08,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2024-11-28 04:59:08,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-28 04:59:08,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:59:08,980 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 50 treesize of output 39 [2024-11-28 04:59:09,043 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-28 04:59:09,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-11-28 04:59:12,260 INFO L349 Elim1Store]: treesize reduction 51, result has 25.0 percent of original size [2024-11-28 04:59:12,260 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 1 case distinctions, treesize of input 29 treesize of output 28 [2024-11-28 04:59:12,345 INFO L349 Elim1Store]: treesize reduction 51, result has 25.0 percent of original size [2024-11-28 04:59:12,345 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 1 case distinctions, treesize of input 69 treesize of output 40 [2024-11-28 04:59:12,878 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2024-11-28 04:59:12,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 217 treesize of output 114 [2024-11-28 04:59:12,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 45 [2024-11-28 04:59:13,472 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 153 treesize of output 113 [2024-11-28 04:59:13,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:59:13,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 99 [2024-11-28 04:59:15,589 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:59:15,589 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 31 [2024-11-28 04:59:15,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 04:59:15,648 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 22 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:59:15,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:59:23,642 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 1605 treesize of output 1368 [2024-11-28 04:59:25,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266557212] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:59:25,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:59:25,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 38] total 75 [2024-11-28 04:59:25,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292029771] [2024-11-28 04:59:25,165 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:59:25,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2024-11-28 04:59:25,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:59:25,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2024-11-28 04:59:25,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=8237, Unknown=18, NotChecked=0, Total=8556 [2024-11-28 04:59:25,167 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand has 76 states, 73 states have (on average 1.8082191780821917) internal successors, (132), 67 states have internal predecessors, (132), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:59:44,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:59:44,015 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2024-11-28 04:59:44,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-28 04:59:44,016 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 73 states have (on average 1.8082191780821917) internal successors, (132), 67 states have internal predecessors, (132), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 74 [2024-11-28 04:59:44,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:59:44,016 INFO L225 Difference]: With dead ends: 101 [2024-11-28 04:59:44,016 INFO L226 Difference]: Without dead ends: 101 [2024-11-28 04:59:44,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4026 ImplicationChecksByTransitivity, 33.1s TimeCoverageRelationStatistics Valid=604, Invalid=14878, Unknown=18, NotChecked=0, Total=15500 [2024-11-28 04:59:44,018 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 127 mSDsluCounter, 1576 mSDsCounter, 0 mSdLazyCounter, 2892 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 2905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:59:44,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1619 Invalid, 2905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2892 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2024-11-28 04:59:44,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-28 04:59:44,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2024-11-28 04:59:44,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 91 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:59:44,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2024-11-28 04:59:44,030 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 74 [2024-11-28 04:59:44,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:59:44,030 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2024-11-28 04:59:44,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 73 states have (on average 1.8082191780821917) internal successors, (132), 67 states have internal predecessors, (132), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:59:44,031 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2024-11-28 04:59:44,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 04:59:44,031 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:59:44,032 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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:59:44,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-11-28 04:59:44,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-28 04:59:44,232 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 04:59:44,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:59:44,233 INFO L85 PathProgramCache]: Analyzing trace with hash 2018161404, now seen corresponding path program 2 times [2024-11-28 04:59:44,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:59:44,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896298431] [2024-11-28 04:59:44,233 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:59:44,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:59:44,294 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:59:44,294 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:59:55,777 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 20 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 04:59:55,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:59:55,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896298431] [2024-11-28 04:59:55,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896298431] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:59:55,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703028436] [2024-11-28 04:59:55,777 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:59:55,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:59:55,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:59:55,779 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:59:55,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-28 04:59:56,233 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:59:56,233 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:59:56,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 146 conjuncts are in the unsatisfiable core [2024-11-28 04:59:56,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:59:56,456 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:59:58,767 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 04:59:58,767 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:59:59,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:59:59,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:59:59,787 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:59:59,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-28 04:59:59,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 05:00:01,131 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 30 treesize of output 14 [2024-11-28 05:00:01,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 05:00:01,146 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 11 treesize of output 3 [2024-11-28 05:00:02,602 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 05:00:02,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-28 05:00:02,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:00:02,647 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 38 treesize of output 27 [2024-11-28 05:00:02,712 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-28 05:00:02,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-28 05:00:05,717 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 05:00:05,718 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 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-28 05:00:05,767 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2024-11-28 05:00:05,768 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 1 case distinctions, treesize of input 51 treesize of output 34 [2024-11-28 05:00:06,298 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2024-11-28 05:00:06,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 71 [2024-11-28 05:00:06,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 15 [2024-11-28 05:00:06,826 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 80 treesize of output 52 [2024-11-28 05:00:07,597 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 7 treesize of output 3 [2024-11-28 05:00:08,822 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:00:08,823 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 24 [2024-11-28 05:00:09,119 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 19 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:00:09,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:00:11,985 INFO L349 Elim1Store]: treesize reduction 5, result has 85.3 percent of original size [2024-11-28 05:00:11,985 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 38 treesize of output 37 [2024-11-28 05:00:14,268 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_36| Int) (v_ArrVal_5422 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5425 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_36| 0) (< (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_5422) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5426) .cse1) .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_36|) (= (select (let ((.cse3 (store (store |c_#memory_$Pointer$#2.base| .cse0 (store (select |c_#memory_$Pointer$#2.base| .cse0) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5425))) (select .cse3 (select (select .cse3 .cse1) .cse2))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_36| 4)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))))) is different from false [2024-11-28 05:00:14,366 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_36| Int) (v_ArrVal_5422 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5425 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse4))) (or (< (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_5422) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5426) .cse1) .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_36|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_36| 0) (= (select (let ((.cse3 (store (store |c_#memory_$Pointer$#2.base| .cse0 (store (select |c_#memory_$Pointer$#2.base| .cse0) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse4) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5425))) (select .cse3 (select (select .cse3 .cse1) .cse2))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_36| 4)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))))) is different from false [2024-11-28 05:00:14,413 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_36| Int) (v_ArrVal_5422 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5425 (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse4) .cse5)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.base| .cse3 (store (select |c_#memory_$Pointer$#2.base| .cse3) (+ (select (select |c_#memory_$Pointer$#2.offset| .cse4) .cse5) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5425))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_36| 4)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_36| 0) (< (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse3 v_ArrVal_5422) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5426) .cse1) .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_36|))))) is different from false [2024-11-28 05:00:14,522 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_36| Int) (v_ArrVal_5422 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5425 (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse4) .cse5)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.base| .cse3 (store (select |c_#memory_$Pointer$#2.base| .cse3) (+ (select (select |c_#memory_$Pointer$#2.offset| .cse4) .cse5) 4) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_5425))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_36| 4))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_36| 0) (< (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse3 v_ArrVal_5422) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_5426) .cse1) .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_36|))))) is different from false [2024-11-28 05:00:15,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703028436] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:00:15,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:00:15,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 37] total 78 [2024-11-28 05:00:15,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358652384] [2024-11-28 05:00:15,263 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:00:15,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2024-11-28 05:00:15,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:00:15,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2024-11-28 05:00:15,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=7440, Unknown=134, NotChecked=708, Total=8556 [2024-11-28 05:00:15,265 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand has 79 states, 76 states have (on average 1.7236842105263157) internal successors, (131), 70 states have internal predecessors, (131), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 05:00:36,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:00:36,234 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2024-11-28 05:00:36,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-28 05:00:36,235 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 76 states have (on average 1.7236842105263157) internal successors, (131), 70 states have internal predecessors, (131), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 74 [2024-11-28 05:00:36,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:00:36,235 INFO L225 Difference]: With dead ends: 101 [2024-11-28 05:00:36,235 INFO L226 Difference]: Without dead ends: 101 [2024-11-28 05:00:36,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3561 ImplicationChecksByTransitivity, 33.3s TimeCoverageRelationStatistics Valid=651, Invalid=15986, Unknown=149, NotChecked=1036, Total=17822 [2024-11-28 05:00:36,237 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 123 mSDsluCounter, 1610 mSDsCounter, 0 mSdLazyCounter, 3401 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 3421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:00:36,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1651 Invalid, 3421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 3401 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2024-11-28 05:00:36,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-28 05:00:36,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2024-11-28 05:00:36,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 82 states have (on average 1.170731707317073) internal successors, (96), 91 states have internal predecessors, (96), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 05:00:36,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2024-11-28 05:00:36,240 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 74 [2024-11-28 05:00:36,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:00:36,240 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2024-11-28 05:00:36,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 76 states have (on average 1.7236842105263157) internal successors, (131), 70 states have internal predecessors, (131), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 05:00:36,241 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2024-11-28 05:00:36,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-28 05:00:36,241 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:00:36,241 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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 05:00:36,250 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-11-28 05:00:36,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:00:36,442 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 05:00:36,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:00:36,442 INFO L85 PathProgramCache]: Analyzing trace with hash 2096642021, now seen corresponding path program 1 times [2024-11-28 05:00:36,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:00:36,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462887515] [2024-11-28 05:00:36,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:00:36,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:00:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:00:42,811 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:00:42,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:00:42,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462887515] [2024-11-28 05:00:42,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462887515] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:00:42,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349538563] [2024-11-28 05:00:42,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:00:42,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:00:42,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:00:42,814 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:00:42,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-28 05:00:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:00:43,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 149 conjuncts are in the unsatisfiable core [2024-11-28 05:00:43,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:00:45,343 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 05:00:45,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-28 05:00:46,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:00:46,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:00:46,595 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:00:46,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 51 [2024-11-28 05:00:46,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 05:00:47,884 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 42 treesize of output 18 [2024-11-28 05:00:47,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 05:00:47,900 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 11 treesize of output 3 [2024-11-28 05:00:49,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:00:49,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-28 05:00:49,323 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-28 05:00:49,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-28 05:00:49,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 15 [2024-11-28 05:00:53,004 INFO L349 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2024-11-28 05:00:53,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 41 [2024-11-28 05:00:53,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:00:53,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 15 [2024-11-28 05:00:53,457 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2024-11-28 05:00:53,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 76 [2024-11-28 05:00:53,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 44 treesize of output 15 [2024-11-28 05:00:53,943 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 91 treesize of output 59 [2024-11-28 05:00:54,677 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 7 treesize of output 3 [2024-11-28 05:00:55,809 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:00:55,809 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 27 [2024-11-28 05:00:55,826 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:00:55,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:00:57,843 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5662 (Array Int Int)) (v_ArrVal_5661 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_41| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (< (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5661) .cse0) .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_41|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_41| 0) (not (= (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5662))) (select .cse2 (select (select .cse2 .cse0) .cse1))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_41| 4)) 0))))) is different from false [2024-11-28 05:01:01,784 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5671 (Array Int Int)) (v_ArrVal_5660 (Array Int Int)) (v_ArrVal_5662 (Array Int Int)) (v_ArrVal_5661 (Array Int Int)) (v_ArrVal_5672 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_41| Int) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_72| Int)) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_72| v_ArrVal_5671)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse0 (select (select .cse8 .cse6) .cse7))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (.cse3 (select .cse8 .cse0)) (.cse4 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_72| v_ArrVal_5672) .cse6) .cse7) 4))) (or (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_72| 0) (< (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_5660) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_72| v_ArrVal_5661) .cse1) .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_41|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_41| 0) (not (= 0 (select .cse3 .cse4))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_72|) 0)) (not (= (select (let ((.cse5 (store (store |c_#memory_$Pointer$#2.base| .cse0 (store .cse3 .cse4 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_72|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_72| v_ArrVal_5662))) (select .cse5 (select (select .cse5 .cse1) .cse2))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_41| 4)) 0))))))) is different from false [2024-11-28 05:01:01,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349538563] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:01:01,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:01:01,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 41] total 75 [2024-11-28 05:01:01,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060102520] [2024-11-28 05:01:01,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:01:01,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2024-11-28 05:01:01,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:01:01,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2024-11-28 05:01:01,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=7513, Unknown=3, NotChecked=350, Total=8190 [2024-11-28 05:01:01,791 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand has 75 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 66 states have internal predecessors, (135), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 05:01:13,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:01:13,885 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2024-11-28 05:01:13,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-28 05:01:13,886 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 66 states have internal predecessors, (135), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 77 [2024-11-28 05:01:13,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:01:13,887 INFO L225 Difference]: With dead ends: 101 [2024-11-28 05:01:13,887 INFO L226 Difference]: Without dead ends: 101 [2024-11-28 05:01:13,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3242 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=559, Invalid=11878, Unknown=3, NotChecked=442, Total=12882 [2024-11-28 05:01:13,889 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 126 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 2532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:01:13,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1628 Invalid, 2532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-11-28 05:01:13,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-28 05:01:13,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2024-11-28 05:01:13,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 91 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 05:01:13,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2024-11-28 05:01:13,893 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 77 [2024-11-28 05:01:13,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:01:13,893 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2024-11-28 05:01:13,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 66 states have internal predecessors, (135), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 05:01:13,894 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2024-11-28 05:01:13,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-28 05:01:13,894 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:01:13,895 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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 05:01:13,908 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-11-28 05:01:14,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-28 05:01:14,095 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 05:01:14,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:01:14,096 INFO L85 PathProgramCache]: Analyzing trace with hash 497149351, now seen corresponding path program 2 times [2024-11-28 05:01:14,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:01:14,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473102232] [2024-11-28 05:01:14,096 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:01:14,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:01:14,168 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:01:14,169 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:01:24,324 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 23 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:01:24,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:01:24,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473102232] [2024-11-28 05:01:24,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473102232] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:01:24,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928241517] [2024-11-28 05:01:24,324 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:01:24,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:01:24,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:01:24,327 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:01:24,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-28 05:01:25,070 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:01:25,070 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:01:25,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 167 conjuncts are in the unsatisfiable core [2024-11-28 05:01:25,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:01:27,455 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 05:01:27,455 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 05:01:28,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 05:01:28,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 05:01:28,584 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:01:28,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 05:01:28,605 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 30 treesize of output 13 [2024-11-28 05:01:30,013 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 42 treesize of output 14 [2024-11-28 05:01:30,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2024-11-28 05:01:30,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 05:01:30,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:01:30,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:01:30,829 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 50 treesize of output 39 [2024-11-28 05:01:30,890 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-28 05:01:30,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-11-28 05:01:30,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-28 05:01:33,695 INFO L349 Elim1Store]: treesize reduction 51, result has 25.0 percent of original size [2024-11-28 05:01:33,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2024-11-28 05:01:33,768 INFO L349 Elim1Store]: treesize reduction 51, result has 25.0 percent of original size [2024-11-28 05:01:33,768 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 1 case distinctions, treesize of input 69 treesize of output 40 [2024-11-28 05:01:33,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-11-28 05:01:34,262 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2024-11-28 05:01:34,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 288 treesize of output 137 [2024-11-28 05:01:34,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 45 [2024-11-28 05:01:34,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 95 treesize of output 29 [2024-11-28 05:01:34,812 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 155 treesize of output 115 [2024-11-28 05:01:34,818 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 119 treesize of output 87 [2024-11-28 05:01:36,754 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-28 05:01:36,754 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 33 [2024-11-28 05:01:36,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2024-11-28 05:01:37,681 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:01:37,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:01:39,756 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5901 (Array Int Int)) (v_ArrVal_5903 (Array Int Int)) (v_ArrVal_5902 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5903)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse0 (select (select .cse5 .cse6) .cse7))) (or (< .cse0 0) (not (= v_ArrVal_5901 (let ((.cse1 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 8))) (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse1 (select v_ArrVal_5901 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5902))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (+ .cse0 4))) (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5901) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))))))) is different from false [2024-11-28 05:01:39,804 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5899 (Array Int Int)) (v_ArrVal_5901 (Array Int Int)) (v_ArrVal_5903 (Array Int Int)) (v_ArrVal_5902 (Array Int Int))) (let ((.cse8 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse4 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5903)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse5 (select (select .cse4 .cse6) .cse7)) (.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_5899))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5902))) (let ((.cse2 (select (select .cse1 .cse6) .cse7)) (.cse3 (+ 4 .cse5))) (select (select (store .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5901) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))) (< .cse5 0) (not (= (let ((.cse9 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 8))) (store (select .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse9 (select v_ArrVal_5901 .cse9))) v_ArrVal_5901))))))) is different from false [2024-11-28 05:01:39,921 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5899 (Array Int Int)) (v_ArrVal_5901 (Array Int Int)) (v_ArrVal_5903 (Array Int Int)) (v_ArrVal_5902 (Array Int Int))) (let ((.cse8 (+ |c_ULTIMATE.start_dll_append_#t~mem11#1.offset| 4))) (let ((.cse4 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_#t~mem11#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5903)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse5 (select (select .cse4 .cse6) .cse7)) (.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_append_#t~mem11#1.base| v_ArrVal_5899))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_#t~mem11#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5902))) (let ((.cse2 (select (select .cse1 .cse6) .cse7)) (.cse3 (+ .cse5 4))) (select (select (store .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5901) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))) (< .cse5 0) (not (= (let ((.cse9 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 8))) (store (select .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse9 (select v_ArrVal_5901 .cse9))) v_ArrVal_5901))))))) is different from false [2024-11-28 05:01:39,968 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5899 (Array Int Int)) (v_ArrVal_5901 (Array Int Int)) (v_ArrVal_5903 (Array Int Int)) (v_ArrVal_5902 (Array Int Int))) (let ((.cse11 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse11)) (.cse9 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse11) 4))) (let ((.cse5 (store (store |c_#memory_$Pointer$#2.offset| .cse8 (store (select |c_#memory_$Pointer$#2.offset| .cse8) .cse9 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5903)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse0 (select (select .cse5 .cse6) .cse7)) (.cse1 (store |c_#memory_int#2| .cse8 v_ArrVal_5899))) (or (< .cse0 0) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (store (store |c_#memory_$Pointer$#2.base| .cse8 (store (select |c_#memory_$Pointer$#2.base| .cse8) .cse9 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5902))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (+ .cse0 4))) (select (select (store .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5901) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))) (not (= (let ((.cse10 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 8))) (store (select .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse10 (select v_ArrVal_5901 .cse10))) v_ArrVal_5901)))))))) is different from false [2024-11-28 05:01:40,087 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5899 (Array Int Int)) (v_ArrVal_5901 (Array Int Int)) (v_ArrVal_5903 (Array Int Int)) (v_ArrVal_5902 (Array Int Int))) (let ((.cse11 (+ |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse11)) (.cse9 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse11) 4))) (let ((.cse5 (store (store |c_#memory_$Pointer$#2.offset| .cse8 (store (select |c_#memory_$Pointer$#2.offset| .cse8) .cse9 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5903)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse0 (select (select .cse5 .cse6) .cse7)) (.cse1 (store |c_#memory_int#2| .cse8 v_ArrVal_5899))) (or (< .cse0 0) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (store (store |c_#memory_$Pointer$#2.base| .cse8 (store (select |c_#memory_$Pointer$#2.base| .cse8) .cse9 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5902))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (+ .cse0 4))) (select (select (store .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5901) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))) (not (= (let ((.cse10 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 8))) (store (select .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse10 (select v_ArrVal_5901 .cse10))) v_ArrVal_5901)))))))) is different from false [2024-11-28 05:01:40,135 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5899 (Array Int Int)) (v_ArrVal_5901 (Array Int Int)) (v_ArrVal_5903 (Array Int Int)) (v_ArrVal_5902 (Array Int Int))) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse12 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| .cse11) .cse12)) (.cse9 (+ (select (select |c_#memory_$Pointer$#2.offset| .cse11) .cse12) 4))) (let ((.cse5 (store (store |c_#memory_$Pointer$#2.offset| .cse8 (store (select |c_#memory_$Pointer$#2.offset| .cse8) .cse9 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5903)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse0 (select (select .cse5 .cse6) .cse7)) (.cse1 (store |c_#memory_int#2| .cse8 v_ArrVal_5899))) (or (< .cse0 0) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (store (store |c_#memory_$Pointer$#2.base| .cse8 (store (select |c_#memory_$Pointer$#2.base| .cse8) .cse9 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5902))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (+ .cse0 4))) (select (select (store .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5901) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))) (not (= v_ArrVal_5901 (let ((.cse10 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 8))) (store (select .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse10 (select v_ArrVal_5901 .cse10))))))))))) is different from false [2024-11-28 05:01:40,258 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5899 (Array Int Int)) (v_ArrVal_5901 (Array Int Int)) (v_ArrVal_5903 (Array Int Int)) (v_ArrVal_5902 (Array Int Int))) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse12 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| .cse11) .cse12)) (.cse10 (+ (select (select |c_#memory_$Pointer$#2.offset| .cse11) .cse12) 4))) (let ((.cse6 (store (store |c_#memory_$Pointer$#2.offset| .cse9 (store (select |c_#memory_$Pointer$#2.offset| .cse9) .cse10 |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_5903)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse0 (store |c_#memory_int#2| .cse9 v_ArrVal_5899)) (.cse2 (select (select .cse6 .cse7) .cse8))) (or (not (= (let ((.cse1 (+ 8 |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|))) (store (select .cse0 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) .cse1 (select v_ArrVal_5901 .cse1))) v_ArrVal_5901)) (< .cse2 0) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$#2.base| .cse9 (store (select |c_#memory_$Pointer$#2.base| .cse9) .cse10 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_5902))) (let ((.cse4 (select (select .cse3 .cse7) .cse8)) (.cse5 (+ .cse2 4))) (select (select (store .cse0 |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_5901) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))))))))) is different from false [2024-11-28 05:01:40,711 INFO L349 Elim1Store]: treesize reduction 955, result has 50.3 percent of original size [2024-11-28 05:01:40,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 5929 treesize of output 5939 [2024-11-28 05:01:40,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:01:40,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1031 treesize of output 1033 [2024-11-28 05:01:40,905 INFO L349 Elim1Store]: treesize reduction 482, result has 50.4 percent of original size [2024-11-28 05:01:40,905 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 1060 treesize of output 1307 [2024-11-28 05:01:41,538 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 240 treesize of output 3 [2024-11-28 05:01:41,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:01:41,669 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 71 [2024-11-28 05:01:41,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-28 05:01:41,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:01:41,806 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 1196 treesize of output 1200 [2024-11-28 05:01:42,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:01:42,253 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 1259 treesize of output 1747 [2024-11-28 05:01:55,538 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse55 (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_append_~data#1|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (and (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| Int)) (or (forall ((v_prenex_112 (Array Int Int)) (v_prenex_113 (Array Int Int)) (v_ArrVal_5914 (Array Int Int)) (v_prenex_114 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5914))) (let ((.cse1 (select (select .cse9 .cse6) .cse7))) (or (forall ((v_prenex_115 (Array Int Int)) (v_prenex_116 (Array Int Int)) (v_prenex_117 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_117))) (let ((.cse2 (+ (select (select .cse5 .cse6) .cse7) 4))) (or (= (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| .cse1 (store (select |c_#memory_$Pointer$#2.offset| .cse1) .cse2 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_115))) (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$#2.base| .cse1 (store (select |c_#memory_$Pointer$#2.base| .cse1) .cse2 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_116) .cse3) .cse4)) (+ 4 (select (select .cse0 .cse3) .cse4)))) 0) (< (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 (store (select .cse5 .cse1) .cse2 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_115) .cse3) .cse4) 0))))) (= (let ((.cse11 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_114))) (let ((.cse10 (+ 4 (select (select .cse11 .cse6) .cse7)))) (let ((.cse8 (store (store |c_#memory_$Pointer$#2.offset| .cse1 (store (select .cse11 .cse1) .cse10 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_112))) (select (select .cse8 (select (select (store (store |c_#memory_$Pointer$#2.base| .cse1 (store (select .cse9 .cse1) .cse10 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_113) .cse3) .cse4)) (+ (select (select .cse8 .cse3) .cse4) 4))))) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| Int)) (or (forall ((v_ArrVal_5914 (Array Int Int))) (let ((.cse12 (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5914) .cse6) .cse7))) (or (forall ((v_prenex_115 (Array Int Int)) (v_prenex_117 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse12 (store v_prenex_117 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_117) .cse6) .cse7) 4) 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_115) .cse3) .cse4) 0)) (not (= .cse12 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| Int)) (or (forall ((v_ArrVal_5914 (Array Int Int))) (let ((.cse15 (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5914) .cse6) .cse7))) (or (forall ((v_prenex_112 (Array Int Int)) (v_prenex_113 (Array Int Int)) (v_prenex_114 (Array Int Int)) (v_prenex_115 (Array Int Int)) (v_prenex_116 (Array Int Int)) (v_prenex_117 (Array Int Int))) (let ((.cse13 (let ((.cse18 (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_114) .cse6) .cse7)))) (let ((.cse17 (store (store |c_#memory_$Pointer$#2.offset| .cse15 (store v_prenex_114 .cse18 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_112))) (select (select .cse17 (select (select (store (store |c_#memory_$Pointer$#2.base| .cse15 (store v_ArrVal_5914 .cse18 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_113) .cse3) .cse4)) (+ (select (select .cse17 .cse3) .cse4) 4)))))) (or (= .cse13 0) (= (let ((.cse16 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_117) .cse6) .cse7) 4))) (let ((.cse14 (store (store |c_#memory_$Pointer$#2.offset| .cse15 (store v_prenex_117 .cse16 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_115))) (select (select .cse14 (select (select (store (store |c_#memory_$Pointer$#2.base| .cse15 (store v_ArrVal_5914 .cse16 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_116) .cse3) .cse4)) (+ (select (select .cse14 .cse3) .cse4) 4)))) .cse13)))) (not (= .cse15 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) (forall ((v_ArrVal_5903 (Array Int Int)) (v_ArrVal_5902 (Array Int Int)) (v_ArrVal_5915 (Array Int Int))) (let ((.cse21 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5915) .cse6) .cse7) 4))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse15 (store v_ArrVal_5915 .cse21 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5903) .cse3) .cse4))) (or (< .cse19 0) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| (select (let ((.cse20 (store (store |c_#memory_$Pointer$#2.base| .cse15 (store v_ArrVal_5914 .cse21 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5902))) (select .cse20 (select (select .cse20 .cse3) .cse4))) (+ .cse19 4)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| Int)) (or (forall ((v_ArrVal_5914 (Array Int Int))) (let ((.cse22 (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5914) .cse6) .cse7))) (or (not (= .cse22 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) (forall ((v_ArrVal_5903 (Array Int Int)) (v_ArrVal_5902 (Array Int Int)) (v_ArrVal_5915 (Array Int Int))) (let ((.cse25 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5915) .cse6) .cse7) 4))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse22 (store v_ArrVal_5915 .cse25 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5903) .cse3) .cse4))) (or (< .cse23 0) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| (select (let ((.cse24 (store (store |c_#memory_$Pointer$#2.base| .cse22 (store v_ArrVal_5914 .cse25 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5902))) (select .cse24 (select (select .cse24 .cse3) .cse4))) (+ .cse23 4)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| Int)) (or (forall ((v_prenex_112 (Array Int Int)) (v_prenex_113 (Array Int Int)) (v_ArrVal_5914 (Array Int Int)) (v_prenex_114 (Array Int Int))) (let ((.cse40 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5914))) (let ((.cse29 (select (select .cse40 .cse6) .cse7))) (let ((.cse30 (select .cse40 .cse29))) (let ((.cse27 (let ((.cse39 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_114))) (let ((.cse38 (+ 4 (select (select .cse39 .cse6) .cse7)))) (let ((.cse37 (store (store |c_#memory_$Pointer$#2.offset| .cse29 (store (select .cse39 .cse29) .cse38 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_112))) (select (select .cse37 (select (select (store (store |c_#memory_$Pointer$#2.base| .cse29 (store .cse30 .cse38 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_113) .cse3) .cse4)) (+ (select (select .cse37 .cse3) .cse4) 4))))))) (or (forall ((v_prenex_115 (Array Int Int)) (v_prenex_116 (Array Int Int)) (v_prenex_117 (Array Int Int))) (let ((.cse26 (let ((.cse32 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_117))) (let ((.cse31 (+ (select (select .cse32 .cse6) .cse7) 4))) (let ((.cse28 (store (store |c_#memory_$Pointer$#2.offset| .cse29 (store (select .cse32 .cse29) .cse31 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_115))) (select (select .cse28 (select (select (store (store |c_#memory_$Pointer$#2.base| .cse29 (store .cse30 .cse31 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_116) .cse3) .cse4)) (+ (select (select .cse28 .cse3) .cse4) 4))))))) (or (= .cse26 0) (= .cse26 .cse27)))) (forall ((v_ArrVal_5903 (Array Int Int)) (v_ArrVal_5902 (Array Int Int)) (v_ArrVal_5915 (Array Int Int))) (let ((.cse36 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5915))) (let ((.cse34 (+ (select (select .cse36 .cse6) .cse7) 4))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse29 (store (select .cse36 .cse29) .cse34 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5903) .cse3) .cse4))) (or (= (select (let ((.cse33 (store (store |c_#memory_$Pointer$#2.base| .cse29 (store .cse30 .cse34 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5902))) (select .cse33 (select (select .cse33 .cse3) .cse4))) (+ .cse35 4)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|) (< .cse35 0)))))) (= .cse27 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| Int)) (or (forall ((v_prenex_112 (Array Int Int)) (v_prenex_113 (Array Int Int)) (v_ArrVal_5914 (Array Int Int)) (v_prenex_114 (Array Int Int))) (let ((.cse54 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5914)) (.cse53 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_114))) (let ((.cse52 (+ 4 (select (select .cse53 .cse6) .cse7))) (.cse41 (select (select .cse54 .cse6) .cse7))) (let ((.cse46 (select .cse54 .cse41)) (.cse51 (store (store |c_#memory_$Pointer$#2.offset| .cse41 (store (select .cse53 .cse41) .cse52 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_112))) (let ((.cse50 (select (select .cse51 .cse3) .cse4)) (.cse42 (store (store |c_#memory_$Pointer$#2.base| .cse41 (store .cse46 .cse52 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_113))) (let ((.cse43 (select (select .cse42 .cse3) .cse4)) (.cse44 (+ .cse50 4))) (let ((.cse49 (select (select .cse51 .cse43) .cse44))) (or (not (= .cse41 (select (select .cse42 .cse43) .cse44))) (forall ((v_prenex_115 (Array Int Int)) (v_prenex_116 (Array Int Int)) (v_prenex_117 (Array Int Int))) (= (let ((.cse48 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_117))) (let ((.cse47 (+ (select (select .cse48 .cse6) .cse7) 4))) (let ((.cse45 (store (store |c_#memory_$Pointer$#2.offset| .cse41 (store (select .cse48 .cse41) .cse47 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_115))) (select (select .cse45 (select (select (store (store |c_#memory_$Pointer$#2.base| .cse41 (store .cse46 .cse47 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_116) .cse3) .cse4)) (+ (select (select .cse45 .cse3) .cse4) 4))))) .cse49)) (< .cse50 0) (= .cse49 0))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|) 0)))) (or .cse55 (forall ((v_prenex_112 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| Int) (v_prenex_113 (Array Int Int)) (v_ArrVal_5914 (Array Int Int)) (v_prenex_114 (Array Int Int))) (let ((.cse61 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_114)) (.cse58 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5914))) (let ((.cse56 (select (select .cse58 .cse6) .cse7)) (.cse59 (+ 4 (select (select .cse61 .cse6) .cse7)))) (let ((.cse60 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse56 (store (select .cse61 .cse56) .cse59 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_112) .cse3) .cse4))) (or (not (= .cse56 (select (let ((.cse57 (store (store |c_#memory_$Pointer$#2.base| .cse56 (store (select .cse58 .cse56) .cse59 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_113))) (select .cse57 (select (select .cse57 .cse3) .cse4))) (+ .cse60 4)))) (< .cse60 0) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|) 0)))))))) (or .cse55 (forall ((v_prenex_112 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| Int) (v_prenex_113 (Array Int Int)) (v_ArrVal_5914 (Array Int Int)) (v_prenex_114 (Array Int Int)) (v_prenex_115 (Array Int Int)) (v_prenex_116 (Array Int Int)) (v_prenex_117 (Array Int Int))) (let ((.cse75 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5914)) (.cse74 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_114))) (let ((.cse73 (+ 4 (select (select .cse74 .cse6) .cse7))) (.cse62 (select (select .cse75 .cse6) .cse7))) (let ((.cse70 (select .cse75 .cse62)) (.cse67 (store (store |c_#memory_$Pointer$#2.offset| .cse62 (store (select .cse74 .cse62) .cse73 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_112))) (let ((.cse68 (select (select .cse67 .cse3) .cse4)) (.cse63 (store (store |c_#memory_$Pointer$#2.base| .cse62 (store .cse70 .cse73 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_113))) (let ((.cse66 (let ((.cse72 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_117))) (let ((.cse71 (+ (select (select .cse72 .cse6) .cse7) 4))) (let ((.cse69 (store (store |c_#memory_$Pointer$#2.offset| .cse62 (store (select .cse72 .cse62) .cse71 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_115))) (select (select .cse69 (select (select (store (store |c_#memory_$Pointer$#2.base| .cse62 (store .cse70 .cse71 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_116) .cse3) .cse4)) (+ (select (select .cse69 .cse3) .cse4) 4)))))) (.cse64 (select (select .cse63 .cse3) .cse4)) (.cse65 (+ .cse68 4))) (or (not (= .cse62 (select (select .cse63 .cse64) .cse65))) (= .cse66 0) (= .cse66 (select (select .cse67 .cse64) .cse65)) (< .cse68 0) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|) 0)))))))))) (or .cse55 (forall ((v_prenex_112 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| Int) (v_prenex_113 (Array Int Int)) (v_ArrVal_5914 (Array Int Int)) (v_prenex_114 (Array Int Int)) (v_prenex_115 (Array Int Int)) (v_prenex_116 (Array Int Int)) (v_prenex_117 (Array Int Int))) (let ((.cse86 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_117)) (.cse85 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5914))) (let ((.cse77 (select (select .cse85 .cse6) .cse7)) (.cse79 (+ (select (select .cse86 .cse6) .cse7) 4))) (let ((.cse76 (store (store |c_#memory_$Pointer$#2.offset| .cse77 (store (select .cse86 .cse77) .cse79 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_115)) (.cse78 (select .cse85 .cse77))) (let ((.cse81 (let ((.cse84 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_114))) (let ((.cse83 (+ 4 (select (select .cse84 .cse6) .cse7)))) (let ((.cse82 (store (store |c_#memory_$Pointer$#2.offset| .cse77 (store (select .cse84 .cse77) .cse83 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_112))) (select (select .cse82 (select (select (store (store |c_#memory_$Pointer$#2.base| .cse77 (store .cse78 .cse83 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_113) .cse3) .cse4)) (+ (select (select .cse82 .cse3) .cse4) 4)))))) (.cse80 (select (select .cse76 .cse3) .cse4))) (or (= (select (select .cse76 (select (select (store (store |c_#memory_$Pointer$#2.base| .cse77 (store .cse78 .cse79 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_116) .cse3) .cse4)) (+ .cse80 4)) .cse81) (= .cse81 0) (< .cse80 0) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|) 0))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| Int)) (or (forall ((v_prenex_112 (Array Int Int)) (v_prenex_113 (Array Int Int)) (v_ArrVal_5914 (Array Int Int)) (v_prenex_114 (Array Int Int))) (let ((.cse101 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5914)) (.cse100 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_114))) (let ((.cse99 (+ 4 (select (select .cse100 .cse6) .cse7))) (.cse87 (select (select .cse101 .cse6) .cse7))) (let ((.cse94 (select .cse101 .cse87)) (.cse98 (store (store |c_#memory_$Pointer$#2.offset| .cse87 (store (select .cse100 .cse87) .cse99 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_112))) (let ((.cse97 (select (select .cse98 .cse3) .cse4)) (.cse88 (store (store |c_#memory_$Pointer$#2.base| .cse87 (store .cse94 .cse99 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_113))) (let ((.cse89 (select (select .cse88 .cse3) .cse4)) (.cse90 (+ .cse97 4))) (let ((.cse92 (select (select .cse98 .cse89) .cse90))) (or (not (= .cse87 (select (select .cse88 .cse89) .cse90))) (forall ((v_prenex_115 (Array Int Int)) (v_prenex_116 (Array Int Int)) (v_prenex_117 (Array Int Int))) (let ((.cse91 (let ((.cse96 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_117))) (let ((.cse95 (+ (select (select .cse96 .cse6) .cse7) 4))) (let ((.cse93 (store (store |c_#memory_$Pointer$#2.offset| .cse87 (store (select .cse96 .cse87) .cse95 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_115))) (select (select .cse93 (select (select (store (store |c_#memory_$Pointer$#2.base| .cse87 (store .cse94 .cse95 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_116) .cse3) .cse4)) (+ (select (select .cse93 .cse3) .cse4) 4))))))) (or (= .cse91 0) (= .cse91 .cse92)))) (< .cse97 0) (= .cse92 0))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| Int)) (or (forall ((v_prenex_112 (Array Int Int)) (v_prenex_113 (Array Int Int)) (v_ArrVal_5914 (Array Int Int)) (v_prenex_114 (Array Int Int))) (let ((.cse115 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5914))) (let ((.cse103 (select (select .cse115 .cse6) .cse7))) (let ((.cse104 (select .cse115 .cse103))) (let ((.cse111 (let ((.cse114 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_114))) (let ((.cse113 (+ 4 (select (select .cse114 .cse6) .cse7)))) (let ((.cse112 (store (store |c_#memory_$Pointer$#2.offset| .cse103 (store (select .cse114 .cse103) .cse113 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_112))) (select (select .cse112 (select (select (store (store |c_#memory_$Pointer$#2.base| .cse103 (store .cse104 .cse113 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_113) .cse3) .cse4)) (+ (select (select .cse112 .cse3) .cse4) 4))))))) (or (forall ((v_ArrVal_5903 (Array Int Int)) (v_ArrVal_5902 (Array Int Int)) (v_ArrVal_5915 (Array Int Int))) (let ((.cse107 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5915))) (let ((.cse105 (+ (select (select .cse107 .cse6) .cse7) 4))) (let ((.cse106 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse103 (store (select .cse107 .cse103) .cse105 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5903) .cse3) .cse4))) (or (= (select (let ((.cse102 (store (store |c_#memory_$Pointer$#2.base| .cse103 (store .cse104 .cse105 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5902))) (select .cse102 (select (select .cse102 .cse3) .cse4))) (+ .cse106 4)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|) (< .cse106 0)))))) (forall ((v_prenex_115 (Array Int Int)) (v_prenex_116 (Array Int Int)) (v_prenex_117 (Array Int Int))) (= (let ((.cse110 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_117))) (let ((.cse109 (+ (select (select .cse110 .cse6) .cse7) 4))) (let ((.cse108 (store (store |c_#memory_$Pointer$#2.offset| .cse103 (store (select .cse110 .cse103) .cse109 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_115))) (select (select .cse108 (select (select (store (store |c_#memory_$Pointer$#2.base| .cse103 (store .cse104 .cse109 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_116) .cse3) .cse4)) (+ (select (select .cse108 .cse3) .cse4) 4))))) .cse111)) (= .cse111 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| Int)) (or (forall ((v_ArrVal_5914 (Array Int Int))) (let ((.cse119 (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5914) .cse6) .cse7))) (or (forall ((v_prenex_112 (Array Int Int)) (v_prenex_113 (Array Int Int)) (v_prenex_114 (Array Int Int))) (let ((.cse125 (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_114) .cse6) .cse7)))) (let ((.cse124 (store (store |c_#memory_$Pointer$#2.offset| .cse119 (store v_prenex_114 .cse125 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_112))) (let ((.cse117 (select (select .cse124 .cse3) .cse4)) (.cse121 (store (store |c_#memory_$Pointer$#2.base| .cse119 (store v_ArrVal_5914 .cse125 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_113))) (let ((.cse122 (select (select .cse121 .cse3) .cse4)) (.cse123 (+ .cse117 4))) (let ((.cse116 (select (select .cse124 .cse122) .cse123))) (or (= .cse116 0) (< .cse117 0) (forall ((v_prenex_115 (Array Int Int)) (v_prenex_116 (Array Int Int)) (v_prenex_117 (Array Int Int))) (= (let ((.cse120 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_117) .cse6) .cse7) 4))) (let ((.cse118 (store (store |c_#memory_$Pointer$#2.offset| .cse119 (store v_prenex_117 .cse120 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_115))) (select (select .cse118 (select (select (store (store |c_#memory_$Pointer$#2.base| .cse119 (store v_ArrVal_5914 .cse120 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_116) .cse3) .cse4)) (+ (select (select .cse118 .cse3) .cse4) 4)))) .cse116)) (not (= .cse119 (select (select .cse121 .cse122) .cse123)))))))))) (not (= .cse119 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| Int)) (or (forall ((v_ArrVal_5914 (Array Int Int))) (let ((.cse128 (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5914) .cse6) .cse7))) (or (forall ((v_prenex_115 (Array Int Int)) (v_prenex_116 (Array Int Int)) (v_prenex_117 (Array Int Int))) (let ((.cse132 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_117) .cse6) .cse7) 4))) (let ((.cse131 (store (store |c_#memory_$Pointer$#2.offset| .cse128 (store v_prenex_117 .cse132 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_115))) (let ((.cse130 (select (select .cse131 .cse3) .cse4))) (let ((.cse126 (select (select .cse131 (select (select (store (store |c_#memory_$Pointer$#2.base| .cse128 (store v_ArrVal_5914 .cse132 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_116) .cse3) .cse4)) (+ .cse130 4)))) (or (forall ((v_prenex_112 (Array Int Int)) (v_prenex_113 (Array Int Int)) (v_prenex_114 (Array Int Int))) (= .cse126 (let ((.cse129 (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_114) .cse6) .cse7)))) (let ((.cse127 (store (store |c_#memory_$Pointer$#2.offset| .cse128 (store v_prenex_114 .cse129 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_112))) (select (select .cse127 (select (select (store (store |c_#memory_$Pointer$#2.base| .cse128 (store v_ArrVal_5914 .cse129 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_113) .cse3) .cse4)) (+ (select (select .cse127 .cse3) .cse4) 4)))))) (< .cse130 0) (= .cse126 0))))))) (not (= .cse128 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|) 0)))) (or .cse55 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| Int) (v_ArrVal_5914 (Array Int Int)) (v_prenex_115 (Array Int Int)) (v_prenex_117 (Array Int Int))) (or (< (select (select (store (let ((.cse133 (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5914) .cse6) .cse7))) (store |c_#memory_$Pointer$#2.offset| .cse133 (let ((.cse134 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_117))) (store (select .cse134 .cse133) (+ (select (select .cse134 .cse6) .cse7) 4) 0)))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_115) .cse3) .cse4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|) 0))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| Int)) (or (forall ((v_ArrVal_5914 (Array Int Int))) (let ((.cse136 (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5914) .cse6) .cse7))) (or (forall ((v_prenex_112 (Array Int Int)) (v_prenex_113 (Array Int Int)) (v_prenex_114 (Array Int Int))) (let ((.cse138 (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_114) .cse6) .cse7)))) (let ((.cse135 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse136 (store v_prenex_114 .cse138 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_112) .cse3) .cse4))) (or (< .cse135 0) (not (= .cse136 (select (let ((.cse137 (store (store |c_#memory_$Pointer$#2.base| .cse136 (store v_ArrVal_5914 .cse138 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_113))) (select .cse137 (select (select .cse137 .cse3) .cse4))) (+ .cse135 4)))))))) (not (= .cse136 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| Int)) (or (forall ((v_ArrVal_5914 (Array Int Int))) (let ((.cse142 (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5914) .cse6) .cse7))) (or (forall ((v_prenex_112 (Array Int Int)) (v_prenex_113 (Array Int Int)) (v_prenex_114 (Array Int Int))) (let ((.cse139 (let ((.cse145 (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_114) .cse6) .cse7)))) (let ((.cse144 (store (store |c_#memory_$Pointer$#2.offset| .cse142 (store v_prenex_114 .cse145 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_112))) (select (select .cse144 (select (select (store (store |c_#memory_$Pointer$#2.base| .cse142 (store v_ArrVal_5914 .cse145 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_113) .cse3) .cse4)) (+ (select (select .cse144 .cse3) .cse4) 4)))))) (or (= .cse139 0) (forall ((v_prenex_115 (Array Int Int)) (v_prenex_116 (Array Int Int)) (v_prenex_117 (Array Int Int))) (let ((.cse143 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_117) .cse6) .cse7) 4))) (let ((.cse141 (store (store |c_#memory_$Pointer$#2.offset| .cse142 (store v_prenex_117 .cse143 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_115))) (let ((.cse140 (select (select .cse141 .cse3) .cse4))) (or (< .cse140 0) (= (select (select .cse141 (select (select (store (store |c_#memory_$Pointer$#2.base| .cse142 (store v_ArrVal_5914 .cse143 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_116) .cse3) .cse4)) (+ .cse140 4)) .cse139))))))))) (not (= .cse142 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| Int)) (or (forall ((v_ArrVal_5914 (Array Int Int)) (v_prenex_115 (Array Int Int)) (v_prenex_116 (Array Int Int)) (v_prenex_117 (Array Int Int))) (let ((.cse156 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_117)) (.cse155 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5914))) (let ((.cse148 (select (select .cse155 .cse6) .cse7)) (.cse154 (+ (select (select .cse156 .cse6) .cse7) 4))) (let ((.cse153 (store (store |c_#memory_$Pointer$#2.offset| .cse148 (store (select .cse156 .cse148) .cse154 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_115))) (let ((.cse149 (select .cse155 .cse148)) (.cse152 (select (select .cse153 .cse3) .cse4))) (let ((.cse146 (select (select .cse153 (select (select (store (store |c_#memory_$Pointer$#2.base| .cse148 (store .cse149 .cse154 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_116) .cse3) .cse4)) (+ .cse152 4)))) (or (forall ((v_prenex_112 (Array Int Int)) (v_prenex_113 (Array Int Int)) (v_prenex_114 (Array Int Int))) (= .cse146 (let ((.cse151 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_114))) (let ((.cse150 (+ 4 (select (select .cse151 .cse6) .cse7)))) (let ((.cse147 (store (store |c_#memory_$Pointer$#2.offset| .cse148 (store (select .cse151 .cse148) .cse150 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_112))) (select (select .cse147 (select (select (store (store |c_#memory_$Pointer$#2.base| .cse148 (store .cse149 .cse150 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_113) .cse3) .cse4)) (+ (select (select .cse147 .cse3) .cse4) 4))))))) (= .cse146 0) (< .cse152 0)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| Int)) (or (forall ((v_prenex_112 (Array Int Int)) (v_prenex_113 (Array Int Int)) (v_ArrVal_5914 (Array Int Int)) (v_prenex_114 (Array Int Int))) (let ((.cse168 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5914))) (let ((.cse158 (select (select .cse168 .cse6) .cse7))) (let ((.cse161 (select .cse168 .cse158))) (or (forall ((v_prenex_115 (Array Int Int)) (v_prenex_116 (Array Int Int)) (v_prenex_117 (Array Int Int))) (= (let ((.cse159 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_117) .cse6) .cse7) 4))) (let ((.cse157 (store (store |c_#memory_$Pointer$#2.offset| .cse158 (store (select |c_#memory_$Pointer$#2.offset| .cse158) .cse159 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_115))) (select (select .cse157 (select (select (store (store |c_#memory_$Pointer$#2.base| .cse158 (store (select |c_#memory_$Pointer$#2.base| .cse158) .cse159 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_116) .cse3) .cse4)) (+ 4 (select (select .cse157 .cse3) .cse4))))) 0)) (forall ((v_ArrVal_5903 (Array Int Int)) (v_ArrVal_5902 (Array Int Int)) (v_ArrVal_5915 (Array Int Int))) (let ((.cse164 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5915))) (let ((.cse162 (+ (select (select .cse164 .cse6) .cse7) 4))) (let ((.cse163 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse158 (store (select .cse164 .cse158) .cse162 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5903) .cse3) .cse4))) (or (= (select (let ((.cse160 (store (store |c_#memory_$Pointer$#2.base| .cse158 (store .cse161 .cse162 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5902))) (select .cse160 (select (select .cse160 .cse3) .cse4))) (+ .cse163 4)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|) (< .cse163 0)))))) (= (let ((.cse167 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_114))) (let ((.cse166 (+ 4 (select (select .cse167 .cse6) .cse7)))) (let ((.cse165 (store (store |c_#memory_$Pointer$#2.offset| .cse158 (store (select .cse167 .cse158) .cse166 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_112))) (select (select .cse165 (select (select (store (store |c_#memory_$Pointer$#2.base| .cse158 (store .cse161 .cse166 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_113) .cse3) .cse4)) (+ (select (select .cse165 .cse3) .cse4) 4))))) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| Int)) (or (forall ((v_ArrVal_5914 (Array Int Int)) (v_ArrVal_5903 (Array Int Int)) (v_ArrVal_5902 (Array Int Int)) (v_ArrVal_5915 (Array Int Int))) (let ((.cse174 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5915)) (.cse171 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5914))) (let ((.cse170 (select (select .cse171 .cse6) .cse7)) (.cse172 (+ (select (select .cse174 .cse6) .cse7) 4))) (let ((.cse173 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse170 (store (select .cse174 .cse170) .cse172 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5903) .cse3) .cse4))) (or (= (select (let ((.cse169 (store (store |c_#memory_$Pointer$#2.base| .cse170 (store (select .cse171 .cse170) .cse172 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5902))) (select .cse169 (select (select .cse169 .cse3) .cse4))) (+ .cse173 4)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|) (< .cse173 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| Int)) (or (forall ((v_prenex_112 (Array Int Int)) (v_prenex_113 (Array Int Int)) (v_ArrVal_5914 (Array Int Int)) (v_prenex_114 (Array Int Int))) (let ((.cse185 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_114)) (.cse183 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5914))) (let ((.cse175 (select (select .cse183 .cse6) .cse7)) (.cse184 (+ 4 (select (select .cse185 .cse6) .cse7)))) (let ((.cse182 (store (store |c_#memory_$Pointer$#2.offset| .cse175 (store (select .cse185 .cse175) .cse184 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_112))) (let ((.cse181 (select (select .cse182 .cse3) .cse4)) (.cse176 (store (store |c_#memory_$Pointer$#2.base| .cse175 (store (select .cse183 .cse175) .cse184 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_113))) (let ((.cse177 (select (select .cse176 .cse3) .cse4)) (.cse178 (+ .cse181 4))) (or (not (= .cse175 (select (select .cse176 .cse177) .cse178))) (forall ((v_prenex_115 (Array Int Int)) (v_prenex_116 (Array Int Int)) (v_prenex_117 (Array Int Int))) (= (let ((.cse180 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_117) .cse6) .cse7) 4))) (let ((.cse179 (store (store |c_#memory_$Pointer$#2.offset| .cse175 (store (select |c_#memory_$Pointer$#2.offset| .cse175) .cse180 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_115))) (select (select .cse179 (select (select (store (store |c_#memory_$Pointer$#2.base| .cse175 (store (select |c_#memory_$Pointer$#2.base| .cse175) .cse180 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_116) .cse3) .cse4)) (+ 4 (select (select .cse179 .cse3) .cse4))))) 0)) (< .cse181 0) (= (select (select .cse182 .cse177) .cse178) 0)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| Int)) (or (forall ((v_prenex_112 (Array Int Int)) (v_prenex_113 (Array Int Int)) (v_ArrVal_5914 (Array Int Int)) (v_prenex_114 (Array Int Int))) (let ((.cse197 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5914))) (let ((.cse190 (select (select .cse197 .cse6) .cse7))) (let ((.cse191 (select .cse197 .cse190))) (let ((.cse187 (let ((.cse196 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_114))) (let ((.cse195 (+ 4 (select (select .cse196 .cse6) .cse7)))) (let ((.cse194 (store (store |c_#memory_$Pointer$#2.offset| .cse190 (store (select .cse196 .cse190) .cse195 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_112))) (select (select .cse194 (select (select (store (store |c_#memory_$Pointer$#2.base| .cse190 (store .cse191 .cse195 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_113) .cse3) .cse4)) (+ (select (select .cse194 .cse3) .cse4) 4))))))) (or (forall ((v_prenex_115 (Array Int Int)) (v_prenex_116 (Array Int Int)) (v_prenex_117 (Array Int Int))) (let ((.cse193 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_117))) (let ((.cse192 (+ (select (select .cse193 .cse6) .cse7) 4))) (let ((.cse189 (store (store |c_#memory_$Pointer$#2.offset| .cse190 (store (select .cse193 .cse190) .cse192 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_115))) (let ((.cse188 (select (select .cse189 .cse3) .cse4))) (let ((.cse186 (select (select .cse189 (select (select (store (store |c_#memory_$Pointer$#2.base| .cse190 (store .cse191 .cse192 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_116) .cse3) .cse4)) (+ .cse188 4)))) (or (= .cse186 0) (= .cse186 .cse187) (< .cse188 0)))))))) (= .cse187 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| Int)) (or (forall ((v_ArrVal_5914 (Array Int Int))) (let ((.cse203 (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_ArrVal_5914) .cse6) .cse7))) (or (forall ((v_prenex_112 (Array Int Int)) (v_prenex_113 (Array Int Int)) (v_prenex_114 (Array Int Int)) (v_prenex_115 (Array Int Int)) (v_prenex_116 (Array Int Int)) (v_prenex_117 (Array Int Int))) (let ((.cse207 (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_114) .cse6) .cse7)))) (let ((.cse200 (store (store |c_#memory_$Pointer$#2.offset| .cse203 (store v_prenex_114 .cse207 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_112))) (let ((.cse198 (select (select .cse200 .cse3) .cse4)) (.cse204 (store (store |c_#memory_$Pointer$#2.base| .cse203 (store v_ArrVal_5914 .cse207 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_113))) (let ((.cse199 (let ((.cse206 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_117) .cse6) .cse7) 4))) (let ((.cse205 (store (store |c_#memory_$Pointer$#2.offset| .cse203 (store v_prenex_117 .cse206 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_115))) (select (select .cse205 (select (select (store (store |c_#memory_$Pointer$#2.base| .cse203 (store v_ArrVal_5914 .cse206 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76| v_prenex_116) .cse3) .cse4)) (+ (select (select .cse205 .cse3) .cse4) 4))))) (.cse201 (select (select .cse204 .cse3) .cse4)) (.cse202 (+ .cse198 4))) (or (< .cse198 0) (= .cse199 0) (= .cse199 (select (select .cse200 .cse201) .cse202)) (not (= .cse203 (select (select .cse204 .cse201) .cse202))))))))) (not (= .cse203 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_76|) 0)))))) is different from true [2024-11-28 05:01:55,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928241517] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:01:55,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:01:55,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 39] total 80 [2024-11-28 05:01:55,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593182497] [2024-11-28 05:01:55,546 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:01:55,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2024-11-28 05:01:55,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:01:55,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2024-11-28 05:01:55,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=7059, Unknown=8, NotChecked=1400, Total=8742 [2024-11-28 05:01:55,548 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand has 80 states, 78 states have (on average 1.7564102564102564) internal successors, (137), 72 states have internal predecessors, (137), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 05:02:21,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:02:21,830 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2024-11-28 05:02:21,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-28 05:02:21,831 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 78 states have (on average 1.7564102564102564) internal successors, (137), 72 states have internal predecessors, (137), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 78 [2024-11-28 05:02:21,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:02:21,832 INFO L225 Difference]: With dead ends: 101 [2024-11-28 05:02:21,832 INFO L226 Difference]: Without dead ends: 101 [2024-11-28 05:02:21,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 3384 ImplicationChecksByTransitivity, 34.6s TimeCoverageRelationStatistics Valid=563, Invalid=13503, Unknown=8, NotChecked=1928, Total=16002 [2024-11-28 05:02:21,833 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 111 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 3310 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 3320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 3310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:02:21,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1663 Invalid, 3320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 3310 Invalid, 0 Unknown, 0 Unchecked, 13.5s Time] [2024-11-28 05:02:21,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-28 05:02:21,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2024-11-28 05:02:21,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 82 states have (on average 1.146341463414634) internal successors, (94), 91 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 05:02:21,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2024-11-28 05:02:21,837 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 78 [2024-11-28 05:02:21,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:02:21,838 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2024-11-28 05:02:21,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 78 states have (on average 1.7564102564102564) internal successors, (137), 72 states have internal predecessors, (137), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 05:02:21,838 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2024-11-28 05:02:21,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-28 05:02:21,839 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:02:21,839 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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 05:02:21,856 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-11-28 05:02:22,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:02:22,040 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 05:02:22,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:02:22,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1767625965, now seen corresponding path program 3 times [2024-11-28 05:02:22,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:02:22,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007004396] [2024-11-28 05:02:22,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 05:02:22,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:02:22,156 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-28 05:02:22,157 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:02:36,642 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:02:36,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:02:36,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007004396] [2024-11-28 05:02:36,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007004396] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:02:36,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027195358] [2024-11-28 05:02:36,643 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 05:02:36,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:02:36,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:02:36,646 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:02:36,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-28 05:02:39,746 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-28 05:02:39,746 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:02:39,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 175 conjuncts are in the unsatisfiable core [2024-11-28 05:02:39,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:02:40,108 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 05:02:43,604 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 05:02:43,604 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 05:02:44,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:02:44,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:02:45,318 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:02:45,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-28 05:02:45,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 05:02:47,465 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 30 treesize of output 14 [2024-11-28 05:02:47,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 05:02:47,488 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 11 treesize of output 3 [2024-11-28 05:02:51,194 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2024-11-28 05:02:51,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 33 treesize of output 29 [2024-11-28 05:02:51,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:02:51,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 55 treesize of output 32 [2024-11-28 05:02:51,352 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-28 05:02:51,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-28 05:02:56,584 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2024-11-28 05:02:56,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 55 [2024-11-28 05:02:56,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2024-11-28 05:02:57,500 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-28 05:02:57,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 90 [2024-11-28 05:02:57,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:02:57,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 77 [2024-11-28 05:02:58,400 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 135 treesize of output 95 [2024-11-28 05:03:03,726 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 22 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:03:03,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:03:28,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027195358] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:03:28,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:03:28,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 41] total 80 [2024-11-28 05:03:28,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217880734] [2024-11-28 05:03:28,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:03:28,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2024-11-28 05:03:28,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:03:28,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2024-11-28 05:03:28,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=8835, Unknown=0, NotChecked=0, Total=9120 [2024-11-28 05:03:28,108 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand has 80 states, 78 states have (on average 1.8205128205128205) internal successors, (142), 70 states have internal predecessors, (142), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 05:03:56,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:03:56,514 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2024-11-28 05:03:56,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-28 05:03:56,515 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 78 states have (on average 1.8205128205128205) internal successors, (142), 70 states have internal predecessors, (142), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 79 [2024-11-28 05:03:56,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:03:56,515 INFO L225 Difference]: With dead ends: 91 [2024-11-28 05:03:56,516 INFO L226 Difference]: Without dead ends: 91 [2024-11-28 05:03:56,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3260 ImplicationChecksByTransitivity, 64.4s TimeCoverageRelationStatistics Valid=579, Invalid=15677, Unknown=0, NotChecked=0, Total=16256 [2024-11-28 05:03:56,517 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 61 mSDsluCounter, 1619 mSDsCounter, 0 mSdLazyCounter, 3165 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 3176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:03:56,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1658 Invalid, 3176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3165 Invalid, 0 Unknown, 0 Unchecked, 13.8s Time] [2024-11-28 05:03:56,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-28 05:03:56,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-28 05:03:56,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.0886075949367089) internal successors, (86), 85 states have internal predecessors, (86), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 05:03:56,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2024-11-28 05:03:56,519 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 79 [2024-11-28 05:03:56,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:03:56,520 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2024-11-28 05:03:56,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 78 states have (on average 1.8205128205128205) internal successors, (142), 70 states have internal predecessors, (142), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 05:03:56,520 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2024-11-28 05:03:56,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-28 05:03:56,520 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:03:56,520 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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 05:03:56,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2024-11-28 05:03:56,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:03:56,721 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 05:03:56,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:03:56,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1251328015, now seen corresponding path program 2 times [2024-11-28 05:03:56,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:03:56,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875976064] [2024-11-28 05:03:56,721 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:03:56,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:03:56,752 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:03:56,752 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:03:57,043 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-28 05:03:57,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:03:57,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875976064] [2024-11-28 05:03:57,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875976064] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:03:57,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961687666] [2024-11-28 05:03:57,043 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:03:57,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:03:57,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:03:57,045 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:03:57,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-28 05:03:57,557 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:03:57,557 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:03:57,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 05:03:57,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:03:58,089 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-28 05:03:58,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:03:58,668 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-28 05:03:58,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961687666] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:03:58,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:03:58,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-28 05:03:58,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901222400] [2024-11-28 05:03:58,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:03:58,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 05:03:58,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:03:58,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 05:03:58,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-28 05:03:58,669 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 05:03:58,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:03:58,848 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2024-11-28 05:03:58,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 05:03:58,849 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 82 [2024-11-28 05:03:58,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:03:58,850 INFO L225 Difference]: With dead ends: 87 [2024-11-28 05:03:58,850 INFO L226 Difference]: Without dead ends: 87 [2024-11-28 05:03:58,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-28 05:03:58,850 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:03:58,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 467 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:03:58,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-28 05:03:58,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-28 05:03:58,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 81 states have internal predecessors, (82), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 05:03:58,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2024-11-28 05:03:58,854 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 82 [2024-11-28 05:03:58,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:03:58,854 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2024-11-28 05:03:58,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 05:03:58,854 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2024-11-28 05:03:58,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-28 05:03:58,854 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:03:58,854 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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 05:03:58,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2024-11-28 05:03:59,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-28 05:03:59,055 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 05:03:59,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:03:59,055 INFO L85 PathProgramCache]: Analyzing trace with hash 137446218, now seen corresponding path program 1 times [2024-11-28 05:03:59,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:03:59,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423796621] [2024-11-28 05:03:59,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:03:59,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:03:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:03:59,489 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-28 05:03:59,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:03:59,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423796621] [2024-11-28 05:03:59,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423796621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:03:59,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462253076] [2024-11-28 05:03:59,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:03:59,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:03:59,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:03:59,491 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:03:59,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-28 05:03:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:03:59,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-28 05:03:59,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:04:00,242 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 17 treesize of output 9 [2024-11-28 05:04:00,264 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-28 05:04:00,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:04:00,439 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2024-11-28 05:04:00,439 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 16 treesize of output 15 [2024-11-28 05:04:00,519 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-28 05:04:00,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462253076] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:04:00,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:04:00,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 10 [2024-11-28 05:04:00,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001057257] [2024-11-28 05:04:00,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:04:00,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 05:04:00,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:04:00,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 05:04:00,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-28 05:04:00,521 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 05:04:01,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:04:01,576 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2024-11-28 05:04:01,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 05:04:01,577 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 83 [2024-11-28 05:04:01,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:04:01,577 INFO L225 Difference]: With dead ends: 88 [2024-11-28 05:04:01,578 INFO L226 Difference]: Without dead ends: 88 [2024-11-28 05:04:01,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-28 05:04:01,578 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 7 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:04:01,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 294 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 05:04:01,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-28 05:04:01,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-28 05:04:01,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 78 states have (on average 1.0897435897435896) internal successors, (85), 82 states have internal predecessors, (85), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 05:04:01,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2024-11-28 05:04:01,581 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 83 [2024-11-28 05:04:01,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:04:01,581 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2024-11-28 05:04:01,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 05:04:01,582 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2024-11-28 05:04:01,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-28 05:04:01,582 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:04:01,582 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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 05:04:01,598 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-11-28 05:04:01,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-28 05:04:01,783 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 05:04:01,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:04:01,783 INFO L85 PathProgramCache]: Analyzing trace with hash 137446219, now seen corresponding path program 1 times [2024-11-28 05:04:01,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:04:01,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383496406] [2024-11-28 05:04:01,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:04:01,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:04:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:04:02,876 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-28 05:04:02,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:04:02,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383496406] [2024-11-28 05:04:02,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383496406] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:04:02,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297983073] [2024-11-28 05:04:02,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:04:02,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:04:02,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:04:02,879 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:04:02,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-11-28 05:04:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:04:03,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-28 05:04:03,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:04:03,406 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 05:04:03,422 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 05:04:04,972 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 9 treesize of output 3 [2024-11-28 05:04:04,981 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 9 treesize of output 3 [2024-11-28 05:04:05,200 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_49| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_49|) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2024-11-28 05:04:05,407 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 05:04:05,407 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 15 treesize of output 15 [2024-11-28 05:04:05,417 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 05:04:06,745 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 17 treesize of output 9 [2024-11-28 05:04:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 7 not checked. [2024-11-28 05:04:07,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:04:08,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297983073] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:04:08,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:04:08,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 27 [2024-11-28 05:04:08,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516372943] [2024-11-28 05:04:08,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:04:08,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-28 05:04:08,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:04:08,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-28 05:04:08,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=846, Unknown=1, NotChecked=58, Total=992 [2024-11-28 05:04:08,799 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand has 28 states, 26 states have (on average 4.3076923076923075) internal successors, (112), 25 states have internal predecessors, (112), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-28 05:04:13,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:04:13,374 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2024-11-28 05:04:13,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 05:04:13,375 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 4.3076923076923075) internal successors, (112), 25 states have internal predecessors, (112), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 83 [2024-11-28 05:04:13,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:04:13,376 INFO L225 Difference]: With dead ends: 90 [2024-11-28 05:04:13,376 INFO L226 Difference]: Without dead ends: 90 [2024-11-28 05:04:13,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=141, Invalid=1422, Unknown=1, NotChecked=76, Total=1640 [2024-11-28 05:04:13,377 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 18 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:04:13,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 560 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 900 Invalid, 0 Unknown, 74 Unchecked, 3.5s Time] [2024-11-28 05:04:13,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-28 05:04:13,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-28 05:04:13,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 80 states have (on average 1.075) internal successors, (86), 84 states have internal predecessors, (86), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 05:04:13,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2024-11-28 05:04:13,381 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 83 [2024-11-28 05:04:13,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:04:13,381 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2024-11-28 05:04:13,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 4.3076923076923075) internal successors, (112), 25 states have internal predecessors, (112), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-28 05:04:13,382 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2024-11-28 05:04:13,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-28 05:04:13,382 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:04:13,383 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:04:13,394 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2024-11-28 05:04:13,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-28 05:04:13,583 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 05:04:13,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:04:13,584 INFO L85 PathProgramCache]: Analyzing trace with hash -34132091, now seen corresponding path program 1 times [2024-11-28 05:04:13,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:04:13,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434321830] [2024-11-28 05:04:13,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:04:13,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:04:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:04:14,705 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-28 05:04:14,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:04:14,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434321830] [2024-11-28 05:04:14,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434321830] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:04:14,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286023606] [2024-11-28 05:04:14,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:04:14,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:04:14,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:04:14,708 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:04:14,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-28 05:04:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:04:15,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-28 05:04:15,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:04:16,696 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 16 treesize of output 8 [2024-11-28 05:04:16,712 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-28 05:04:16,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:04:17,213 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-28 05:04:17,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286023606] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:04:17,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:04:17,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 21 [2024-11-28 05:04:17,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208797200] [2024-11-28 05:04:17,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:04:17,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 05:04:17,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:04:17,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 05:04:17,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2024-11-28 05:04:17,215 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand has 21 states, 21 states have (on average 4.095238095238095) internal successors, (86), 19 states have internal predecessors, (86), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-28 05:04:21,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:04:25,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:04:29,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:04:34,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:04:38,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:04:42,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:04:46,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:04:50,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:04:53,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:04:53,084 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2024-11-28 05:04:53,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 05:04:53,085 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.095238095238095) internal successors, (86), 19 states have internal predecessors, (86), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 84 [2024-11-28 05:04:53,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:04:53,086 INFO L225 Difference]: With dead ends: 92 [2024-11-28 05:04:53,086 INFO L226 Difference]: Without dead ends: 92 [2024-11-28 05:04:53,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=124, Invalid=1136, Unknown=0, NotChecked=0, Total=1260 [2024-11-28 05:04:53,087 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 43 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 4 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:04:53,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 700 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 594 Invalid, 8 Unknown, 0 Unchecked, 34.4s Time] [2024-11-28 05:04:53,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-28 05:04:53,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2024-11-28 05:04:53,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 80 states have (on average 1.0625) internal successors, (85), 84 states have internal predecessors, (85), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 05:04:53,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2024-11-28 05:04:53,091 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 84 [2024-11-28 05:04:53,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:04:53,092 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2024-11-28 05:04:53,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.095238095238095) internal successors, (86), 19 states have internal predecessors, (86), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-28 05:04:53,092 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2024-11-28 05:04:53,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-28 05:04:53,093 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:04:53,093 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:04:53,108 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2024-11-28 05:04:53,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-28 05:04:53,294 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 05:04:53,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:04:53,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1556546714, now seen corresponding path program 1 times [2024-11-28 05:04:53,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:04:53,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344754330] [2024-11-28 05:04:53,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:04:53,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:04:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:04:54,005 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-28 05:04:54,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:04:54,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344754330] [2024-11-28 05:04:54,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344754330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:04:54,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335973700] [2024-11-28 05:04:54,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:04:54,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:04:54,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:04:54,008 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:04:54,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-28 05:04:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:04:54,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 05:04:54,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:04:55,286 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 17 treesize of output 9 [2024-11-28 05:04:55,337 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-28 05:04:55,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:04:55,924 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 15 treesize of output 7 [2024-11-28 05:04:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-28 05:04:56,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335973700] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:04:56,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:04:56,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 11 [2024-11-28 05:04:56,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670631661] [2024-11-28 05:04:56,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:04:56,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 05:04:56,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:04:56,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 05:04:56,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-28 05:04:56,347 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand has 12 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 05:04:58,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:05:02,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:05:06,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:05:11,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:05:15,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:05:16,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:05:16,385 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2024-11-28 05:05:16,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 05:05:16,386 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 86 [2024-11-28 05:05:16,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:05:16,387 INFO L225 Difference]: With dead ends: 91 [2024-11-28 05:05:16,387 INFO L226 Difference]: Without dead ends: 91 [2024-11-28 05:05:16,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 160 SyntacticMatches, 11 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-11-28 05:05:16,387 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 27 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:05:16,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 324 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 364 Invalid, 4 Unknown, 0 Unchecked, 19.7s Time] [2024-11-28 05:05:16,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-28 05:05:16,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-28 05:05:16,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 85 states have internal predecessors, (86), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 05:05:16,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2024-11-28 05:05:16,395 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 86 [2024-11-28 05:05:16,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:05:16,395 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2024-11-28 05:05:16,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 05:05:16,396 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2024-11-28 05:05:16,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-28 05:05:16,396 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:05:16,397 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:05:16,407 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2024-11-28 05:05:16,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:05:16,597 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 05:05:16,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:05:16,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1678573710, now seen corresponding path program 1 times [2024-11-28 05:05:16,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:05:16,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008137206] [2024-11-28 05:05:16,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:05:16,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:05:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:05:23,361 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 21 proven. 25 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-28 05:05:23,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:05:23,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008137206] [2024-11-28 05:05:23,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008137206] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:05:23,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178972745] [2024-11-28 05:05:23,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:05:23,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:05:23,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:05:23,364 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:05:23,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-11-28 05:05:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:05:23,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-11-28 05:05:23,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:05:24,369 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:05:24,369 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 05:05:24,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:05:25,028 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:05:25,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-28 05:05:26,330 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 30 treesize of output 14 [2024-11-28 05:05:26,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 05:05:27,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:05:27,902 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 38 treesize of output 27 [2024-11-28 05:05:28,068 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2024-11-28 05:05:28,069 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 36 treesize of output 52 [2024-11-28 05:05:29,689 INFO L349 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2024-11-28 05:05:29,689 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 1 case distinctions, treesize of input 55 treesize of output 50 [2024-11-28 05:05:30,373 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-11-28 05:05:30,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 74 [2024-11-28 05:05:30,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 05:05:31,535 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-28 05:05:31,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 05:05:35,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 128 treesize of output 80 [2024-11-28 05:05:37,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:05:37,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 59 [2024-11-28 05:05:39,771 INFO L349 Elim1Store]: treesize reduction 72, result has 35.7 percent of original size [2024-11-28 05:05:39,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 61 treesize of output 82 [2024-11-28 05:05:40,376 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 26 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-28 05:05:40,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:05:47,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178972745] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:05:47,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:05:47,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 33] total 63 [2024-11-28 05:05:47,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805148658] [2024-11-28 05:05:47,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:05:47,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-11-28 05:05:47,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:05:47,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-11-28 05:05:47,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=5665, Unknown=2, NotChecked=0, Total=6006 [2024-11-28 05:05:47,942 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand has 64 states, 61 states have (on average 2.3442622950819674) internal successors, (143), 56 states have internal predecessors, (143), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-28 05:06:05,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:05,805 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2024-11-28 05:06:05,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-28 05:06:05,806 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 61 states have (on average 2.3442622950819674) internal successors, (143), 56 states have internal predecessors, (143), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 89 [2024-11-28 05:06:05,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:05,806 INFO L225 Difference]: With dead ends: 99 [2024-11-28 05:06:05,806 INFO L226 Difference]: Without dead ends: 99 [2024-11-28 05:06:05,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2326 ImplicationChecksByTransitivity, 28.0s TimeCoverageRelationStatistics Valid=630, Invalid=9468, Unknown=2, NotChecked=0, Total=10100 [2024-11-28 05:06:05,808 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 55 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 2753 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 2762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:06:05,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 800 Invalid, 2762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2753 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2024-11-28 05:06:05,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-28 05:06:05,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2024-11-28 05:06:05,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 84 states have (on average 1.0833333333333333) internal successors, (91), 88 states have internal predecessors, (91), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 05:06:05,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2024-11-28 05:06:05,811 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 89 [2024-11-28 05:06:05,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:05,812 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2024-11-28 05:06:05,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 61 states have (on average 2.3442622950819674) internal successors, (143), 56 states have internal predecessors, (143), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-28 05:06:05,812 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2024-11-28 05:06:05,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-28 05:06:05,813 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:05,813 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:06:05,825 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2024-11-28 05:06:06,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:06,013 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-28 05:06:06,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:06,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1678573709, now seen corresponding path program 1 times [2024-11-28 05:06:06,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:06:06,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416564143] [2024-11-28 05:06:06,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:06,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:06:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:08,608 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-28 05:06:08,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:06:08,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416564143] [2024-11-28 05:06:08,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416564143] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:06:08,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102048719] [2024-11-28 05:06:08,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:08,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:08,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:06:08,611 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:06:08,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_087bdf43-13b9-43fa-b573-2f9f2497e4c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-11-28 05:06:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:09,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 176 conjuncts are in the unsatisfiable core [2024-11-28 05:06:09,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:06:09,376 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 05:06:10,415 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 05:06:10,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:06:12,232 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 05:06:12,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-28 05:06:12,295 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:06:12,296 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 05:06:12,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 05:06:12,332 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 05:06:12,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 05:06:12,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 05:06:13,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-28 05:06:13,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-28 05:06:13,692 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 05:06:13,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 68 [2024-11-28 05:06:13,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2024-11-28 05:06:15,167 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-28 05:06:15,167 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 32 [2024-11-28 05:06:15,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-28 05:06:15,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 05:06:15,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 05:06:16,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:06:16,926 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-28 05:06:16,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 58 [2024-11-28 05:06:17,026 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-28 05:06:17,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-28 05:06:17,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2024-11-28 05:06:17,098 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 22 treesize of output 17 [2024-11-28 05:06:19,245 INFO L349 Elim1Store]: treesize reduction 52, result has 42.9 percent of original size [2024-11-28 05:06:19,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 78 [2024-11-28 05:06:19,432 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-28 05:06:19,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 42 [2024-11-28 05:06:20,625 INFO L349 Elim1Store]: treesize reduction 80, result has 35.5 percent of original size [2024-11-28 05:06:20,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 199 treesize of output 176 [2024-11-28 05:06:21,000 INFO L349 Elim1Store]: treesize reduction 112, result has 37.8 percent of original size [2024-11-28 05:06:21,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 186 treesize of output 224 [2024-11-28 05:06:25,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 05:06:26,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 05:06:29,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 05:06:29,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 05:06:33,169 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 45 treesize of output 29 [2024-11-28 05:06:33,254 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 29 treesize of output 17 [2024-11-28 05:06:33,282 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 45 treesize of output 29 [2024-11-28 05:06:33,306 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 29 treesize of output 17 [2024-11-28 05:06:33,986 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 45 treesize of output 29 [2024-11-28 05:06:34,181 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 45 treesize of output 29 [2024-11-28 05:06:34,301 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 45 treesize of output 29 [2024-11-28 05:06:34,341 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 45 treesize of output 29 [2024-11-28 05:06:34,390 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 45 treesize of output 29 [2024-11-28 05:06:58,873 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-28 05:06:58,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7