./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_append_unequal.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_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/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_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/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_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/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 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:20:47,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:20:47,499 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 05:20:47,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:20:47,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:20:47,543 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:20:47,544 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:20:47,544 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:20:47,545 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 05:20:47,545 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 05:20:47,545 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:20:47,545 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:20:47,545 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:20:47,546 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:20:47,546 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:20:47,546 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:20:47,546 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 05:20:47,547 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 05:20:47,547 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 05:20:47,547 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:20:47,547 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 05:20:47,547 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 05:20:47,548 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 05:20:47,548 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:20:47,549 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 05:20:47,549 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 05:20:47,549 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 05:20:47,549 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:20:47,549 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:20:47,550 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:20:47,550 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:20:47,550 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:20:47,550 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:20:47,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:20:47,550 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:20:47,550 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:20:47,550 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:20:47,550 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:20:47,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:20:47,550 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:20:47,551 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:20:47,551 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 05:20:47,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 05:20:47,551 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:20:47,551 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:20:47,551 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:20:47,551 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:20:47,551 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_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/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 -> 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 [2024-11-28 05:20:47,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:20:47,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:20:47,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:20:47,871 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:20:47,872 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:20:47,873 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2024-11-28 05:20:50,814 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/data/334829e3f/97e2c61fe6214eba809c0ccd4e200062/FLAG89fc36576 [2024-11-28 05:20:51,203 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:20:51,204 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2024-11-28 05:20:51,227 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/data/334829e3f/97e2c61fe6214eba809c0ccd4e200062/FLAG89fc36576 [2024-11-28 05:20:51,251 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/data/334829e3f/97e2c61fe6214eba809c0ccd4e200062 [2024-11-28 05:20:51,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:20:51,257 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:20:51,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:20:51,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:20:51,263 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:20:51,264 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:20:51" (1/1) ... [2024-11-28 05:20:51,265 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@297d85d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:51, skipping insertion in model container [2024-11-28 05:20:51,266 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:20:51" (1/1) ... [2024-11-28 05:20:51,311 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:20:51,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:20:51,674 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 05:20:51,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:20:51,745 INFO L204 MainTranslator]: Completed translation [2024-11-28 05:20:51,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:51 WrapperNode [2024-11-28 05:20:51,746 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:20:51,746 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 05:20:51,747 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 05:20:51,747 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 05:20:51,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:51" (1/1) ... [2024-11-28 05:20:51,776 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:51" (1/1) ... [2024-11-28 05:20:51,813 INFO L138 Inliner]: procedures = 127, calls = 41, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 141 [2024-11-28 05:20:51,814 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 05:20:51,814 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 05:20:51,814 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 05:20:51,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 05:20:51,824 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:51" (1/1) ... [2024-11-28 05:20:51,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:51" (1/1) ... [2024-11-28 05:20:51,828 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:51" (1/1) ... [2024-11-28 05:20:51,848 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 16, 6]. 67 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 9 writes are split as follows [0, 8, 1]. [2024-11-28 05:20:51,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:51" (1/1) ... [2024-11-28 05:20:51,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:51" (1/1) ... [2024-11-28 05:20:51,857 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:51" (1/1) ... [2024-11-28 05:20:51,858 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:51" (1/1) ... [2024-11-28 05:20:51,862 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:51" (1/1) ... [2024-11-28 05:20:51,863 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:51" (1/1) ... [2024-11-28 05:20:51,865 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:51" (1/1) ... [2024-11-28 05:20:51,867 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 05:20:51,868 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 05:20:51,868 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 05:20:51,868 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 05:20:51,869 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:51" (1/1) ... [2024-11-28 05:20:51,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:20:51,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:20:51,908 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 05:20:51,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 05:20:51,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 05:20:51,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 05:20:51,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-28 05:20:51,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 05:20:51,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 05:20:51,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-28 05:20:51,942 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-28 05:20:51,942 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-28 05:20:51,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 05:20:51,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 05:20:51,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 05:20:51,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 05:20:51,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 05:20:51,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 05:20:51,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 05:20:51,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 05:20:51,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 05:20:51,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 05:20:51,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-28 05:20:51,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-28 05:20:51,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-28 05:20:51,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 05:20:51,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 05:20:51,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 05:20:51,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 05:20:51,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 05:20:52,098 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 05:20:52,101 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 05:20:52,559 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-11-28 05:20:52,560 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 05:20:52,575 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 05:20:52,577 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-28 05:20:52,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:20:52 BoogieIcfgContainer [2024-11-28 05:20:52,578 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 05:20:52,580 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 05:20:52,580 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 05:20:52,586 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 05:20:52,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:20:51" (1/3) ... [2024-11-28 05:20:52,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c93e1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:20:52, skipping insertion in model container [2024-11-28 05:20:52,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:51" (2/3) ... [2024-11-28 05:20:52,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c93e1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:20:52, skipping insertion in model container [2024-11-28 05:20:52,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:20:52" (3/3) ... [2024-11-28 05:20:52,591 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2024-11-28 05:20:52,609 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 05:20:52,611 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_append_unequal.i that has 2 procedures, 112 locations, 1 initial locations, 4 loop locations, and 47 error locations. [2024-11-28 05:20:52,669 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 05:20:52,693 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;@796235f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 05:20:52,693 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2024-11-28 05:20:52,698 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 108 states have internal predecessors, (124), 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 05:20:52,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-28 05:20:52,706 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:20:52,707 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:52,707 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:20:52,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:52,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1813470804, now seen corresponding path program 1 times [2024-11-28 05:20:52,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:20:52,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476710776] [2024-11-28 05:20:52,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:52,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:20:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:53,024 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 05:20:53,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:20:53,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476710776] [2024-11-28 05:20:53,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476710776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:53,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:53,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:20:53,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411088934] [2024-11-28 05:20:53,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:53,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:20:53,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:20:53,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:20:53,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:20:53,067 INFO L87 Difference]: Start difference. First operand has 112 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 108 states have internal predecessors, (124), 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 05:20:53,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:20:53,247 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2024-11-28 05:20:53,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:20:53,250 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 05:20:53,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:20:53,257 INFO L225 Difference]: With dead ends: 108 [2024-11-28 05:20:53,258 INFO L226 Difference]: Without dead ends: 105 [2024-11-28 05:20:53,262 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 05:20:53,266 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 3 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:20:53,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 174 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:20:53,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-28 05:20:53,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-28 05:20:53,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 58 states have (on average 1.896551724137931) internal successors, (110), 101 states have internal predecessors, (110), 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 05:20:53,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2024-11-28 05:20:53,322 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 7 [2024-11-28 05:20:53,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:20:53,323 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2024-11-28 05:20:53,326 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 05:20:53,327 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2024-11-28 05:20:53,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-28 05:20:53,327 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:20:53,327 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:53,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 05:20:53,328 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:20:53,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:53,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1813470805, now seen corresponding path program 1 times [2024-11-28 05:20:53,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:20:53,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657416209] [2024-11-28 05:20:53,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:53,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:20:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:53,509 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 05:20:53,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:20:53,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657416209] [2024-11-28 05:20:53,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657416209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:53,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:53,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:20:53,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023780858] [2024-11-28 05:20:53,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:53,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:20:53,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:20:53,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:20:53,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:20:53,513 INFO L87 Difference]: Start difference. First operand 105 states and 114 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 05:20:53,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:20:53,647 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2024-11-28 05:20:53,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:20:53,648 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 05:20:53,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:20:53,649 INFO L225 Difference]: With dead ends: 102 [2024-11-28 05:20:53,651 INFO L226 Difference]: Without dead ends: 102 [2024-11-28 05:20:53,651 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 05:20:53,652 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 3 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:20:53,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 173 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:20:53,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-28 05:20:53,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-28 05:20:53,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 58 states have (on average 1.8448275862068966) internal successors, (107), 98 states have internal predecessors, (107), 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 05:20:53,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2024-11-28 05:20:53,668 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 7 [2024-11-28 05:20:53,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:20:53,668 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2024-11-28 05:20:53,669 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 05:20:53,669 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2024-11-28 05:20:53,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-28 05:20:53,670 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:20:53,670 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:53,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 05:20:53,670 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:20:53,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:53,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1810188849, now seen corresponding path program 1 times [2024-11-28 05:20:53,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:20:53,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995061427] [2024-11-28 05:20:53,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:53,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:20:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:54,087 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 05:20:54,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:20:54,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995061427] [2024-11-28 05:20:54,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995061427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:54,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:54,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:20:54,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133737461] [2024-11-28 05:20:54,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:54,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:20:54,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:20:54,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:20:54,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:20:54,089 INFO L87 Difference]: Start difference. First operand 102 states and 111 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 05:20:54,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:20:54,358 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2024-11-28 05:20:54,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:20:54,361 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 05:20:54,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:20:54,362 INFO L225 Difference]: With dead ends: 100 [2024-11-28 05:20:54,363 INFO L226 Difference]: Without dead ends: 100 [2024-11-28 05:20:54,363 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 05:20:54,364 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 7 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:20:54,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 334 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:20:54,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-28 05:20:54,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-28 05:20:54,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 58 states have (on average 1.8103448275862069) internal successors, (105), 96 states have internal predecessors, (105), 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 05:20:54,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2024-11-28 05:20:54,377 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 14 [2024-11-28 05:20:54,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:20:54,379 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2024-11-28 05:20:54,379 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 05:20:54,381 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2024-11-28 05:20:54,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-28 05:20:54,382 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:20:54,382 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:54,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 05:20:54,382 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:20:54,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:54,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1810188848, now seen corresponding path program 1 times [2024-11-28 05:20:54,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:20:54,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009430197] [2024-11-28 05:20:54,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:54,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:20:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:54,535 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 05:20:54,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:20:54,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009430197] [2024-11-28 05:20:54,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009430197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:54,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:54,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:20:54,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136975285] [2024-11-28 05:20:54,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:54,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:20:54,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:20:54,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:20:54,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:20:54,537 INFO L87 Difference]: Start difference. First operand 100 states and 109 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 05:20:54,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:20:54,756 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2024-11-28 05:20:54,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:20:54,756 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 05:20:54,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:20:54,757 INFO L225 Difference]: With dead ends: 98 [2024-11-28 05:20:54,757 INFO L226 Difference]: Without dead ends: 98 [2024-11-28 05:20:54,757 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 05:20:54,758 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 8 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:20:54,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 318 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:20:54,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-28 05:20:54,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-28 05:20:54,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 94 states have internal predecessors, (103), 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 05:20:54,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2024-11-28 05:20:54,772 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 14 [2024-11-28 05:20:54,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:20:54,772 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2024-11-28 05:20:54,773 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 05:20:54,773 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2024-11-28 05:20:54,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-28 05:20:54,777 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:20:54,777 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:54,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 05:20:54,778 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:20:54,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:54,778 INFO L85 PathProgramCache]: Analyzing trace with hash -998761136, now seen corresponding path program 1 times [2024-11-28 05:20:54,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:20:54,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747418881] [2024-11-28 05:20:54,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:54,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:20:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:54,872 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 05:20:54,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:20:54,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747418881] [2024-11-28 05:20:54,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747418881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:54,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:54,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:20:54,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896734784] [2024-11-28 05:20:54,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:54,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:20:54,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:20:54,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:20:54,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:20:54,874 INFO L87 Difference]: Start difference. First operand 98 states and 107 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 05:20:54,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:20:54,886 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2024-11-28 05:20:54,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:20:54,887 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 05:20:54,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:20:54,888 INFO L225 Difference]: With dead ends: 108 [2024-11-28 05:20:54,888 INFO L226 Difference]: Without dead ends: 108 [2024-11-28 05:20:54,888 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 05:20:54,889 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 9 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 207 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 05:20:54,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 207 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:20:54,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-28 05:20:54,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 99. [2024-11-28 05:20:54,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 95 states have internal predecessors, (104), 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 05:20:54,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2024-11-28 05:20:54,900 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 16 [2024-11-28 05:20:54,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:20:54,901 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2024-11-28 05:20:54,901 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 05:20:54,901 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2024-11-28 05:20:54,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-28 05:20:54,901 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:20:54,901 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 05:20:54,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 05:20:54,902 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:20:54,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:54,902 INFO L85 PathProgramCache]: Analyzing trace with hash -273410556, now seen corresponding path program 1 times [2024-11-28 05:20:54,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:20:54,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400160038] [2024-11-28 05:20:54,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:54,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:20:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:54,988 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 05:20:54,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:20:54,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400160038] [2024-11-28 05:20:54,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400160038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:54,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:54,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:20:54,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260509682] [2024-11-28 05:20:54,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:54,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:20:54,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:20:54,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:20:54,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:20:54,995 INFO L87 Difference]: Start difference. First operand 99 states and 108 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 05:20:55,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:20:55,022 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2024-11-28 05:20:55,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:20:55,023 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 05:20:55,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:20:55,024 INFO L225 Difference]: With dead ends: 104 [2024-11-28 05:20:55,024 INFO L226 Difference]: Without dead ends: 104 [2024-11-28 05:20:55,025 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 05:20:55,025 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 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 05:20:55,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:20:55,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-28 05:20:55,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-28 05:20:55,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 63 states have (on average 1.7142857142857142) internal successors, (108), 99 states have internal predecessors, (108), 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 05:20:55,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2024-11-28 05:20:55,037 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 17 [2024-11-28 05:20:55,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:20:55,037 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2024-11-28 05:20:55,037 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 05:20:55,037 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2024-11-28 05:20:55,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-28 05:20:55,038 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:20:55,038 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 05:20:55,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 05:20:55,039 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:20:55,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:55,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1870851471, now seen corresponding path program 1 times [2024-11-28 05:20:55,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:20:55,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126537242] [2024-11-28 05:20:55,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:55,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:20:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:55,208 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 05:20:55,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:20:55,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126537242] [2024-11-28 05:20:55,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126537242] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:20:55,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994475202] [2024-11-28 05:20:55,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:55,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:20:55,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:20:55,212 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:20:55,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 05:20:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:55,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 05:20:55,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:20:55,450 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 05:20:55,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:20:55,526 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 05:20:55,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994475202] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:20:55,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:20:55,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-28 05:20:55,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331801143] [2024-11-28 05:20:55,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:20:55,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:20:55,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:20:55,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:20:55,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:20:55,528 INFO L87 Difference]: Start difference. First operand 104 states and 114 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 05:20:55,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:20:55,559 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2024-11-28 05:20:55,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:20:55,559 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 05:20:55,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:20:55,560 INFO L225 Difference]: With dead ends: 106 [2024-11-28 05:20:55,560 INFO L226 Difference]: Without dead ends: 106 [2024-11-28 05:20:55,560 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 05:20:55,561 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 9 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:20:55,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 307 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:20:55,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-28 05:20:55,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-28 05:20:55,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 65 states have (on average 1.6923076923076923) internal successors, (110), 101 states have internal predecessors, (110), 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 05:20:55,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2024-11-28 05:20:55,573 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 31 [2024-11-28 05:20:55,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:20:55,574 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2024-11-28 05:20:55,574 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 05:20:55,574 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2024-11-28 05:20:55,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-28 05:20:55,574 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:20:55,575 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 05:20:55,587 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 05:20:55,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:20:55,775 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:20:55,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:55,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1538407165, now seen corresponding path program 1 times [2024-11-28 05:20:55,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:20:55,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805988909] [2024-11-28 05:20:55,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:55,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:20:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:56,284 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:20:56,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:20:56,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805988909] [2024-11-28 05:20:56,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805988909] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:20:56,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940165972] [2024-11-28 05:20:56,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:56,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:20:56,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:20:56,288 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:20:56,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 05:20:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:56,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-28 05:20:56,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:20:56,512 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 05:20:56,637 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 05:20:56,638 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 05:20:56,656 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 05:20:56,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:20:56,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940165972] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:20:56,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:20:56,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 11 [2024-11-28 05:20:56,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273309815] [2024-11-28 05:20:56,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:20:56,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 05:20:56,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:20:56,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 05:20:56,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=106, Unknown=1, NotChecked=20, Total=156 [2024-11-28 05:20:56,759 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 05:20:57,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:20:57,291 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2024-11-28 05:20:57,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:20:57,292 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2024-11-28 05:20:57,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:20:57,293 INFO L225 Difference]: With dead ends: 105 [2024-11-28 05:20:57,293 INFO L226 Difference]: Without dead ends: 105 [2024-11-28 05:20:57,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=194, Unknown=1, NotChecked=28, Total=272 [2024-11-28 05:20:57,294 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 5 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:20:57,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 572 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 504 Invalid, 0 Unknown, 106 Unchecked, 0.4s Time] [2024-11-28 05:20:57,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-28 05:20:57,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-28 05:20:57,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 65 states have (on average 1.676923076923077) internal successors, (109), 100 states have internal predecessors, (109), 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 05:20:57,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2024-11-28 05:20:57,299 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 32 [2024-11-28 05:20:57,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:20:57,300 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2024-11-28 05:20:57,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 05:20:57,300 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2024-11-28 05:20:57,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-28 05:20:57,301 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:20:57,301 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 05:20:57,310 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 05:20:57,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:20:57,502 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:20:57,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:57,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1538407164, now seen corresponding path program 1 times [2024-11-28 05:20:57,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:20:57,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409371939] [2024-11-28 05:20:57,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:57,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:20:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:58,209 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 05:20:58,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:20:58,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409371939] [2024-11-28 05:20:58,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409371939] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:20:58,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584622126] [2024-11-28 05:20:58,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:58,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:20:58,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:20:58,212 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:20:58,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 05:20:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:58,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-28 05:20:58,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:20:58,400 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:20:58,609 WARN L873 $PredicateComparison]: unable to prove that (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:20:58,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:20:58,668 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:20:58,681 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:20:58,681 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:20:58,703 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-28 05:20:58,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:20:58,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584622126] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:20:58,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:20:58,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2024-11-28 05:20:58,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521077534] [2024-11-28 05:20:58,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:20:58,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 05:20:58,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:20:58,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 05:20:58,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=262, Unknown=1, NotChecked=32, Total=342 [2024-11-28 05:20:58,889 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand has 17 states, 16 states have (on average 2.75) internal successors, (44), 14 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 05:20:59,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:20:59,556 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2024-11-28 05:20:59,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:20:59,556 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.75) internal successors, (44), 14 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2024-11-28 05:20:59,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:20:59,557 INFO L225 Difference]: With dead ends: 104 [2024-11-28 05:20:59,557 INFO L226 Difference]: Without dead ends: 104 [2024-11-28 05:20:59,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=394, Unknown=1, NotChecked=40, Total=506 [2024-11-28 05:20:59,558 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 4 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:20:59,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 609 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 570 Invalid, 0 Unknown, 105 Unchecked, 0.5s Time] [2024-11-28 05:20:59,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-28 05:20:59,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-28 05:20:59,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 99 states have internal predecessors, (108), 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 05:20:59,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2024-11-28 05:20:59,563 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 32 [2024-11-28 05:20:59,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:20:59,564 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2024-11-28 05:20:59,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.75) internal successors, (44), 14 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 05:20:59,564 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2024-11-28 05:20:59,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-28 05:20:59,565 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:20:59,565 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 05:20:59,575 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 05:20:59,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-28 05:20:59,769 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:20:59,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:59,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1763514160, now seen corresponding path program 2 times [2024-11-28 05:20:59,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:20:59,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035417555] [2024-11-28 05:20:59,770 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:20:59,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:20:59,817 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:20:59,818 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:20:59,979 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 05:20:59,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:20:59,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035417555] [2024-11-28 05:20:59,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035417555] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:20:59,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141533193] [2024-11-28 05:20:59,980 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:20:59,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:20:59,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:20:59,982 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:20:59,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 05:21:00,160 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:21:00,160 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:21:00,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 05:21:00,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:21:00,208 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 05:21:00,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:21:00,303 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 05:21:00,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141533193] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:21:00,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:21:00,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2024-11-28 05:21:00,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204875157] [2024-11-28 05:21:00,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:21:00,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:21:00,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:00,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:21:00,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:21:00,310 INFO L87 Difference]: Start difference. First operand 104 states and 114 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 05:21:00,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:00,397 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2024-11-28 05:21:00,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 05:21:00,398 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 05:21:00,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:00,398 INFO L225 Difference]: With dead ends: 104 [2024-11-28 05:21:00,398 INFO L226 Difference]: Without dead ends: 104 [2024-11-28 05:21:00,399 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 05:21:00,399 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 4 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 561 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 05:21:00,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 561 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:21:00,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-28 05:21:00,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-28 05:21:00,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 65 states have (on average 1.646153846153846) internal successors, (107), 99 states have internal predecessors, (107), 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 05:21:00,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2024-11-28 05:21:00,410 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 46 [2024-11-28 05:21:00,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:00,410 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2024-11-28 05:21:00,411 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 05:21:00,411 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2024-11-28 05:21:00,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 05:21:00,412 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:00,412 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 05:21:00,424 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 05:21:00,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:00,613 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:21:00,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:00,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1998206232, now seen corresponding path program 1 times [2024-11-28 05:21:00,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:21:00,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718877987] [2024-11-28 05:21:00,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:00,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:21:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:01,243 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 05:21:01,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:21:01,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718877987] [2024-11-28 05:21:01,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718877987] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:21:01,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340093244] [2024-11-28 05:21:01,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:01,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:01,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:21:01,246 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:21:01,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 05:21:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:01,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-28 05:21:01,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:21:01,460 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:21:01,478 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 05:21:01,494 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|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-11-28 05:21:01,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:21:01,554 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:21:01,596 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 05:21:01,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:21:01,663 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:21:01,702 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 05:21:01,744 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 05:21:01,744 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 05:21:01,764 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 14 not checked. [2024-11-28 05:21:01,765 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:21:02,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340093244] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:21:02,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:21:02,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 14 [2024-11-28 05:21:02,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764456068] [2024-11-28 05:21:02,052 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:21:02,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 05:21:02,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:02,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 05:21:02,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=167, Unknown=2, NotChecked=54, Total=272 [2024-11-28 05:21:02,053 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-28 05:21:02,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:02,503 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2024-11-28 05:21:02,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 05:21:02,504 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 47 [2024-11-28 05:21:02,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:02,505 INFO L225 Difference]: With dead ends: 111 [2024-11-28 05:21:02,505 INFO L226 Difference]: Without dead ends: 111 [2024-11-28 05:21:02,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=240, Unknown=2, NotChecked=66, Total=380 [2024-11-28 05:21:02,506 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 81 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:02,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 303 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 322 Invalid, 0 Unknown, 212 Unchecked, 0.3s Time] [2024-11-28 05:21:02,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-28 05:21:02,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2024-11-28 05:21:02,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 65 states have (on average 1.5692307692307692) internal successors, (102), 94 states have internal predecessors, (102), 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 05:21:02,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2024-11-28 05:21:02,510 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 47 [2024-11-28 05:21:02,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:02,511 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2024-11-28 05:21:02,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-28 05:21:02,511 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2024-11-28 05:21:02,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 05:21:02,512 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:02,512 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 05:21:02,521 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 05:21:02,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:02,713 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:21:02,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:02,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1998206231, now seen corresponding path program 1 times [2024-11-28 05:21:02,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:21:02,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147061343] [2024-11-28 05:21:02,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:02,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:21:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:03,731 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 05:21:03,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:21:03,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147061343] [2024-11-28 05:21:03,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147061343] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:21:03,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732279419] [2024-11-28 05:21:03,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:03,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:03,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:21:03,735 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:21:03,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 05:21:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:03,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-28 05:21:03,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:21:03,983 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:21:04,028 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 05:21:04,040 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 05:21:04,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:21:04,102 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:21:04,164 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 05:21:04,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:21:04,223 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:21:04,346 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 05:21:04,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:21:04,404 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:21:04,436 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 05:21:04,436 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:21:04,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732279419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:04,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 05:21:04,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2024-11-28 05:21:04,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338183058] [2024-11-28 05:21:04,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:04,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:21:04,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:04,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:21:04,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=224, Unknown=1, NotChecked=30, Total=306 [2024-11-28 05:21:04,438 INFO L87 Difference]: Start difference. First operand 99 states and 108 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 05:21:04,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:04,593 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2024-11-28 05:21:04,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 05:21:04,594 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 05:21:04,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:04,595 INFO L225 Difference]: With dead ends: 96 [2024-11-28 05:21:04,595 INFO L226 Difference]: Without dead ends: 96 [2024-11-28 05:21:04,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=253, Unknown=1, NotChecked=32, Total=342 [2024-11-28 05:21:04,596 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 4 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:04,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 232 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 125 Unchecked, 0.1s Time] [2024-11-28 05:21:04,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-28 05:21:04,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-28 05:21:04,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.523076923076923) internal successors, (99), 91 states have internal predecessors, (99), 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 05:21:04,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2024-11-28 05:21:04,600 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 47 [2024-11-28 05:21:04,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:04,600 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2024-11-28 05:21:04,601 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 05:21:04,601 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2024-11-28 05:21:04,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-28 05:21:04,602 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:04,602 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 05:21:04,613 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 05:21:04,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:04,806 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:21:04,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:04,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1178693715, now seen corresponding path program 1 times [2024-11-28 05:21:04,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:21:04,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505480906] [2024-11-28 05:21:04,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:04,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:21:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:05,445 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 05:21:05,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:21:05,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505480906] [2024-11-28 05:21:05,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505480906] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:21:05,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673185878] [2024-11-28 05:21:05,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:05,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:05,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:21:05,448 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:21:05,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 05:21:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:05,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-28 05:21:05,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:21:05,891 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:21:05,901 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 05:21:05,961 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-28 05:21:05,961 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 05:21:05,986 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:21:05,991 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 05:21:05,992 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:21:05,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673185878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:05,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 05:21:05,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 20 [2024-11-28 05:21:05,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129360813] [2024-11-28 05:21:05,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:05,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 05:21:05,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:05,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 05:21:05,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=332, Unknown=1, NotChecked=36, Total=420 [2024-11-28 05:21:05,994 INFO L87 Difference]: Start difference. First operand 96 states and 105 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 05:21:06,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:06,229 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2024-11-28 05:21:06,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 05:21:06,229 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 05:21:06,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:06,230 INFO L225 Difference]: With dead ends: 95 [2024-11-28 05:21:06,231 INFO L226 Difference]: Without dead ends: 95 [2024-11-28 05:21:06,231 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 05:21:06,232 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 10 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:06,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 359 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 256 Invalid, 0 Unknown, 167 Unchecked, 0.2s Time] [2024-11-28 05:21:06,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-28 05:21:06,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-28 05:21:06,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.5) internal successors, (99), 90 states have internal predecessors, (99), 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 05:21:06,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2024-11-28 05:21:06,235 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 51 [2024-11-28 05:21:06,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:06,236 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2024-11-28 05:21:06,236 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 05:21:06,236 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2024-11-28 05:21:06,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-28 05:21:06,237 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:06,237 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 05:21:06,250 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 05:21:06,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:06,437 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:21:06,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:06,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1178693714, now seen corresponding path program 1 times [2024-11-28 05:21:06,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:21:06,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485601400] [2024-11-28 05:21:06,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:06,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:21:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:07,278 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 05:21:07,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:21:07,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485601400] [2024-11-28 05:21:07,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485601400] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:21:07,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573208289] [2024-11-28 05:21:07,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:07,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:07,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:21:07,284 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:21:07,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 05:21:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:07,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-28 05:21:07,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:21:08,047 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:21:08,267 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 05:21:08,268 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 05:21:08,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 17 treesize of output 9 [2024-11-28 05:21:08,515 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 05:21:08,515 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:21:08,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573208289] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:21:08,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:21:08,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2024-11-28 05:21:08,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457500504] [2024-11-28 05:21:08,864 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:21:08,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-28 05:21:08,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:08,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-28 05:21:08,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2024-11-28 05:21:08,867 INFO L87 Difference]: Start difference. First operand 95 states and 105 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 05:21:10,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:10,556 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2024-11-28 05:21:10,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-28 05:21:10,557 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 05:21:10,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:10,558 INFO L225 Difference]: With dead ends: 109 [2024-11-28 05:21:10,558 INFO L226 Difference]: Without dead ends: 109 [2024-11-28 05:21:10,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=195, Invalid=2157, Unknown=0, NotChecked=0, Total=2352 [2024-11-28 05:21:10,560 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 86 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:10,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1147 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-28 05:21:10,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-28 05:21:10,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2024-11-28 05:21:10,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 100 states have internal predecessors, (109), 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:21:10,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2024-11-28 05:21:10,565 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 51 [2024-11-28 05:21:10,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:10,566 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2024-11-28 05:21:10,566 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 05:21:10,566 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2024-11-28 05:21:10,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-28 05:21:10,570 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:10,570 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 05:21:10,581 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-28 05:21:10,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:10,774 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:21:10,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:10,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1178846581, now seen corresponding path program 1 times [2024-11-28 05:21:10,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:21:10,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470036244] [2024-11-28 05:21:10,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:10,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:21:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:11,101 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 05:21:11,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:21:11,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470036244] [2024-11-28 05:21:11,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470036244] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:21:11,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694499611] [2024-11-28 05:21:11,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:11,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:11,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:21:11,105 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:21:11,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 05:21:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:11,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-28 05:21:11,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:21:11,355 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:21:11,361 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:21:11,409 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 05:21:11,417 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 05:21:11,514 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:21:11,515 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:21:11,523 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:21:11,626 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 05:21:11,652 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 05:21:11,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:21:11,695 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:21:11,765 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 05:21:11,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:21:11,834 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:21:11,880 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 05:21:11,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:21:12,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694499611] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:21:12,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:21:12,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2024-11-28 05:21:12,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486269810] [2024-11-28 05:21:12,031 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:21:12,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 05:21:12,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:12,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 05:21:12,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=330, Unknown=1, NotChecked=36, Total=420 [2024-11-28 05:21:12,033 INFO L87 Difference]: Start difference. First operand 106 states and 115 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 05:21:12,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:12,832 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2024-11-28 05:21:12,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 05:21:12,833 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 05:21:12,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:12,834 INFO L225 Difference]: With dead ends: 103 [2024-11-28 05:21:12,834 INFO L226 Difference]: Without dead ends: 103 [2024-11-28 05:21:12,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=797, Unknown=1, NotChecked=58, Total=992 [2024-11-28 05:21:12,835 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 58 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:12,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 632 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 778 Invalid, 0 Unknown, 90 Unchecked, 0.5s Time] [2024-11-28 05:21:12,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-28 05:21:12,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-28 05:21:12,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 75 states have (on average 1.4) internal successors, (105), 97 states have internal predecessors, (105), 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:21:12,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2024-11-28 05:21:12,839 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 51 [2024-11-28 05:21:12,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:12,839 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2024-11-28 05:21:12,840 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 05:21:12,840 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2024-11-28 05:21:12,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-28 05:21:12,840 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:12,840 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 05:21:12,850 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 05:21:13,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-28 05:21:13,041 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:21:13,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:13,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1188181591, now seen corresponding path program 1 times [2024-11-28 05:21:13,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:21:13,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398945928] [2024-11-28 05:21:13,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:13,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:21:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:13,181 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 05:21:13,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:21:13,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398945928] [2024-11-28 05:21:13,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398945928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:13,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:13,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:21:13,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896487295] [2024-11-28 05:21:13,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:13,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:21:13,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:13,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:21:13,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:21:13,184 INFO L87 Difference]: Start difference. First operand 103 states and 111 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 05:21:13,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:13,328 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2024-11-28 05:21:13,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:21:13,328 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 05:21:13,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:13,330 INFO L225 Difference]: With dead ends: 102 [2024-11-28 05:21:13,330 INFO L226 Difference]: Without dead ends: 102 [2024-11-28 05:21:13,330 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 05:21:13,331 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 8 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:13,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 263 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:21:13,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-28 05:21:13,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-28 05:21:13,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 96 states have internal predecessors, (104), 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:21:13,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2024-11-28 05:21:13,337 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 54 [2024-11-28 05:21:13,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:13,337 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2024-11-28 05:21:13,337 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 05:21:13,338 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2024-11-28 05:21:13,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-28 05:21:13,338 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:13,338 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 05:21:13,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 05:21:13,339 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:21:13,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:13,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1188181592, now seen corresponding path program 1 times [2024-11-28 05:21:13,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:21:13,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206432085] [2024-11-28 05:21:13,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:13,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:21:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:13,626 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 05:21:13,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:21:13,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206432085] [2024-11-28 05:21:13,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206432085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:13,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:13,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:21:13,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781667025] [2024-11-28 05:21:13,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:13,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:21:13,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:13,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:21:13,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:21:13,628 INFO L87 Difference]: Start difference. First operand 102 states and 110 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 05:21:13,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:13,760 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2024-11-28 05:21:13,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:21:13,761 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 05:21:13,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:13,761 INFO L225 Difference]: With dead ends: 101 [2024-11-28 05:21:13,761 INFO L226 Difference]: Without dead ends: 101 [2024-11-28 05:21:13,761 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 05:21:13,762 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 7 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:13,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 271 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:21:13,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-28 05:21:13,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-28 05:21:13,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 95 states have internal predecessors, (103), 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:21:13,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2024-11-28 05:21:13,767 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 54 [2024-11-28 05:21:13,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:13,767 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2024-11-28 05:21:13,767 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 05:21:13,767 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2024-11-28 05:21:13,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 05:21:13,768 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:13,768 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 05:21:13,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 05:21:13,768 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:21:13,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:13,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1821142843, now seen corresponding path program 1 times [2024-11-28 05:21:13,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:21:13,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072390149] [2024-11-28 05:21:13,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:13,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:21:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:15,567 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 05:21:15,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:21:15,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072390149] [2024-11-28 05:21:15,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072390149] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:21:15,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793847480] [2024-11-28 05:21:15,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:15,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:15,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:21:15,570 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:21:15,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 05:21:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:15,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-11-28 05:21:15,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:21:16,052 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:21:16,052 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:21:16,200 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:21:16,292 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:21:16,293 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 42 treesize of output 41 [2024-11-28 05:21:16,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 42 treesize of output 14 [2024-11-28 05:21:16,598 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:21:16,688 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2024-11-28 05:21:16,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:21:16,723 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:21:16,763 INFO L349 Elim1Store]: treesize reduction 90, result has 37.9 percent of original size [2024-11-28 05:21:16,764 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 40 treesize of output 69 [2024-11-28 05:21:16,949 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 84 treesize of output 56 [2024-11-28 05:21:16,957 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 51 treesize of output 35 [2024-11-28 05:21:17,183 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 41 treesize of output 17 [2024-11-28 05:21:17,356 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-28 05:21:17,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:21:17,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793847480] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:21:17,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:21:17,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 46 [2024-11-28 05:21:17,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267404771] [2024-11-28 05:21:17,608 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:21:17,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-28 05:21:17,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:17,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-28 05:21:17,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2292, Unknown=1, NotChecked=96, Total=2550 [2024-11-28 05:21:17,611 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand has 47 states, 44 states have (on average 2.1363636363636362) internal successors, (94), 42 states have internal predecessors, (94), 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:21:19,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:19,635 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2024-11-28 05:21:19,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-28 05:21:19,636 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 44 states have (on average 2.1363636363636362) internal successors, (94), 42 states have internal predecessors, (94), 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 55 [2024-11-28 05:21:19,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:19,637 INFO L225 Difference]: With dead ends: 113 [2024-11-28 05:21:19,637 INFO L226 Difference]: Without dead ends: 113 [2024-11-28 05:21:19,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1102 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=341, Invalid=4492, Unknown=1, NotChecked=136, Total=4970 [2024-11-28 05:21:19,639 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 98 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:19,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1245 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1539 Invalid, 0 Unknown, 116 Unchecked, 1.2s Time] [2024-11-28 05:21:19,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-28 05:21:19,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2024-11-28 05:21:19,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 97 states have internal predecessors, (106), 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:21:19,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2024-11-28 05:21:19,646 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 55 [2024-11-28 05:21:19,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:19,646 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2024-11-28 05:21:19,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 44 states have (on average 2.1363636363636362) internal successors, (94), 42 states have internal predecessors, (94), 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:21:19,647 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2024-11-28 05:21:19,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 05:21:19,647 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:19,647 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 05:21:19,660 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 05:21:19,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-28 05:21:19,852 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:21:19,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:19,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1821142842, now seen corresponding path program 1 times [2024-11-28 05:21:19,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:21:19,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288293371] [2024-11-28 05:21:19,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:19,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:21:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:22,090 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:21:22,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:21:22,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288293371] [2024-11-28 05:21:22,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288293371] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:21:22,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322740130] [2024-11-28 05:21:22,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:22,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:22,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:21:22,093 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:21:22,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 05:21:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:22,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 107 conjuncts are in the unsatisfiable core [2024-11-28 05:21:22,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:21:22,447 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:21:22,700 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:21:22,700 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:21:22,848 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:21:22,854 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:21:22,946 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:21:22,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 05:21:22,951 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:21:23,267 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 61 treesize of output 19 [2024-11-28 05:21:23,273 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:21:23,281 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:21:23,286 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:21:23,349 WARN L873 $PredicateComparison]: unable to prove that (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|) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))))) is different from true [2024-11-28 05:21:23,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:21:23,405 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 69 treesize of output 52 [2024-11-28 05:21:23,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:21:23,415 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 28 treesize of output 23 [2024-11-28 05:21:23,439 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-28 05:21:23,439 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:21:23,444 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:21:23,535 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 66 treesize of output 46 [2024-11-28 05:21:23,537 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 50 treesize of output 34 [2024-11-28 05:21:23,668 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 31 treesize of output 13 [2024-11-28 05:21:23,672 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 05:21:23,678 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 05:21:23,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:21:24,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322740130] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:21:24,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:21:24,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 46 [2024-11-28 05:21:24,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609384909] [2024-11-28 05:21:24,224 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:21:24,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-28 05:21:24,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:24,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-28 05:21:24,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2498, Unknown=1, NotChecked=100, Total=2756 [2024-11-28 05:21:24,227 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand has 47 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 41 states have internal predecessors, (87), 6 states have call successors, (6), 3 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 05:21:26,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:26,325 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2024-11-28 05:21:26,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-28 05:21:26,325 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 41 states have internal predecessors, (87), 6 states have call successors, (6), 3 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 05:21:26,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:26,327 INFO L225 Difference]: With dead ends: 108 [2024-11-28 05:21:26,327 INFO L226 Difference]: Without dead ends: 108 [2024-11-28 05:21:26,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=274, Invalid=4285, Unknown=1, NotChecked=132, Total=4692 [2024-11-28 05:21:26,331 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 73 mSDsluCounter, 1376 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 1784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:26,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1445 Invalid, 1784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1668 Invalid, 0 Unknown, 108 Unchecked, 1.2s Time] [2024-11-28 05:21:26,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-28 05:21:26,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2024-11-28 05:21:26,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 99 states have internal predecessors, (108), 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:21:26,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2024-11-28 05:21:26,339 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 55 [2024-11-28 05:21:26,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:26,339 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2024-11-28 05:21:26,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 41 states have internal predecessors, (87), 6 states have call successors, (6), 3 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 05:21:26,340 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2024-11-28 05:21:26,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-28 05:21:26,342 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:26,342 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 05:21:26,354 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-28 05:21:26,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:26,543 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:21:26,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:26,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1710078499, now seen corresponding path program 2 times [2024-11-28 05:21:26,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:21:26,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174547702] [2024-11-28 05:21:26,544 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:21:26,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:21:26,613 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:21:26,614 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:21:30,031 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 05:21:30,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:21:30,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174547702] [2024-11-28 05:21:30,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174547702] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:21:30,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790542455] [2024-11-28 05:21:30,031 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:21:30,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:30,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:21:30,033 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:21:30,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 05:21:30,327 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:21:30,327 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:21:30,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 138 conjuncts are in the unsatisfiable core [2024-11-28 05:21:30,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:21:30,665 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:21:30,673 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:21:31,083 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 05:21:31,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-28 05:21:31,101 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 05:21:31,101 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:21:31,123 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 05:21:31,123 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:21:31,313 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:21:31,321 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:21:31,349 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:21:31,364 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:21:31,503 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 05:21:31,503 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 78 treesize of output 55 [2024-11-28 05:21:31,520 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 38 treesize of output 36 [2024-11-28 05:21:31,998 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-28 05:21:31,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 41 [2024-11-28 05:21:32,004 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:21:32,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 26 treesize of output 10 [2024-11-28 05:21:32,392 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|)))))) is different from true [2024-11-28 05:21:32,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:21:32,451 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-28 05:21:32,451 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 102 treesize of output 69 [2024-11-28 05:21:32,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:21:32,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:21:32,462 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 50 treesize of output 38 [2024-11-28 05:21:32,487 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-28 05:21:32,488 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:21:32,720 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 99 treesize of output 63 [2024-11-28 05:21:33,320 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-28 05:21:33,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:21:33,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790542455] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:21:33,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:21:33,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 59 [2024-11-28 05:21:33,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396534682] [2024-11-28 05:21:33,916 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:21:33,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-28 05:21:33,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:33,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-28 05:21:33,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=3806, Unknown=1, NotChecked=124, Total=4160 [2024-11-28 05:21:33,918 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand has 59 states, 57 states have (on average 1.7894736842105263) internal successors, (102), 53 states have internal predecessors, (102), 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:21:35,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:35,712 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2024-11-28 05:21:35,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-28 05:21:35,712 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 57 states have (on average 1.7894736842105263) internal successors, (102), 53 states have internal predecessors, (102), 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 59 [2024-11-28 05:21:35,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:35,714 INFO L225 Difference]: With dead ends: 140 [2024-11-28 05:21:35,714 INFO L226 Difference]: Without dead ends: 140 [2024-11-28 05:21:35,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1329 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=289, Invalid=4684, Unknown=1, NotChecked=138, Total=5112 [2024-11-28 05:21:35,716 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 13 mSDsluCounter, 1583 mSDsCounter, 0 mSdLazyCounter, 1723 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 1864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:35,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1653 Invalid, 1864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1723 Invalid, 0 Unknown, 133 Unchecked, 1.4s Time] [2024-11-28 05:21:35,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-28 05:21:35,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 135. [2024-11-28 05:21:35,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 126 states have internal predecessors, (137), 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 05:21:35,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2024-11-28 05:21:35,722 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 59 [2024-11-28 05:21:35,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:35,722 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2024-11-28 05:21:35,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 57 states have (on average 1.7894736842105263) internal successors, (102), 53 states have internal predecessors, (102), 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:21:35,723 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2024-11-28 05:21:35,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-28 05:21:35,723 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:35,723 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] [2024-11-28 05:21:35,734 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-28 05:21:35,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:35,924 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:21:35,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:35,924 INFO L85 PathProgramCache]: Analyzing trace with hash -380563205, now seen corresponding path program 1 times [2024-11-28 05:21:35,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:21:35,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218810089] [2024-11-28 05:21:35,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:35,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:21:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:36,164 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 05:21:36,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:21:36,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218810089] [2024-11-28 05:21:36,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218810089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:36,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:36,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 05:21:36,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343154149] [2024-11-28 05:21:36,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:36,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:21:36,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:36,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:21:36,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:21:36,167 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 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 05:21:36,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:36,415 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2024-11-28 05:21:36,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:21:36,415 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 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 59 [2024-11-28 05:21:36,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:36,417 INFO L225 Difference]: With dead ends: 153 [2024-11-28 05:21:36,417 INFO L226 Difference]: Without dead ends: 153 [2024-11-28 05:21:36,417 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 05:21:36,417 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 74 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:36,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 366 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:21:36,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-28 05:21:36,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 132. [2024-11-28 05:21:36,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 107 states have (on average 1.2616822429906542) internal successors, (135), 123 states have internal predecessors, (135), 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 05:21:36,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 145 transitions. [2024-11-28 05:21:36,429 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 145 transitions. Word has length 59 [2024-11-28 05:21:36,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:36,429 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 145 transitions. [2024-11-28 05:21:36,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 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 05:21:36,429 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 145 transitions. [2024-11-28 05:21:36,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-28 05:21:36,430 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:36,430 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] [2024-11-28 05:21:36,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-28 05:21:36,430 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:21:36,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:36,431 INFO L85 PathProgramCache]: Analyzing trace with hash -380563204, now seen corresponding path program 1 times [2024-11-28 05:21:36,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:21:36,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84713983] [2024-11-28 05:21:36,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:36,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:21:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:37,011 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 05:21:37,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:21:37,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84713983] [2024-11-28 05:21:37,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84713983] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:21:37,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076691259] [2024-11-28 05:21:37,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:37,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:37,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:21:37,014 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:21:37,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 05:21:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:37,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-28 05:21:37,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:21:37,335 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:21:37,341 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:21:37,659 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:21:37,663 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:21:37,725 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_main_~#s~0#1.base_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_16| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_16|) 0))) is different from true [2024-11-28 05:21:37,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:21:37,788 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:21:37,799 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 05:21:37,799 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:21:37,961 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:21:38,034 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 05:21:38,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:21:38,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076691259] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:21:38,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:21:38,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2024-11-28 05:21:38,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879023007] [2024-11-28 05:21:38,400 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:21:38,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-28 05:21:38,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:38,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-28 05:21:38,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=792, Unknown=1, NotChecked=56, Total=930 [2024-11-28 05:21:38,402 INFO L87 Difference]: Start difference. First operand 132 states and 145 transitions. Second operand has 27 states, 25 states have (on average 3.28) internal successors, (82), 24 states have internal predecessors, (82), 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:21:39,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:39,248 INFO L93 Difference]: Finished difference Result 159 states and 173 transitions. [2024-11-28 05:21:39,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-28 05:21:39,249 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 3.28) internal successors, (82), 24 states have internal predecessors, (82), 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 59 [2024-11-28 05:21:39,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:39,250 INFO L225 Difference]: With dead ends: 159 [2024-11-28 05:21:39,250 INFO L226 Difference]: Without dead ends: 159 [2024-11-28 05:21:39,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=157, Invalid=1486, Unknown=1, NotChecked=78, Total=1722 [2024-11-28 05:21:39,256 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 173 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:39,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 700 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 871 Invalid, 0 Unknown, 122 Unchecked, 0.6s Time] [2024-11-28 05:21:39,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-28 05:21:39,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 136. [2024-11-28 05:21:39,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 112 states have (on average 1.25) internal successors, (140), 127 states have internal predecessors, (140), 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 05:21:39,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 150 transitions. [2024-11-28 05:21:39,269 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 150 transitions. Word has length 59 [2024-11-28 05:21:39,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:39,270 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 150 transitions. [2024-11-28 05:21:39,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 3.28) internal successors, (82), 24 states have internal predecessors, (82), 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:21:39,270 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 150 transitions. [2024-11-28 05:21:39,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-28 05:21:39,275 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:39,275 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 05:21:39,284 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-28 05:21:39,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-28 05:21:39,476 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:21:39,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:39,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1085285861, now seen corresponding path program 1 times [2024-11-28 05:21:39,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:21:39,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040315519] [2024-11-28 05:21:39,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:39,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:21:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:40,908 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:21:40,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:21:40,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040315519] [2024-11-28 05:21:40,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040315519] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:21:40,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208047694] [2024-11-28 05:21:40,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:40,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:40,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:21:40,910 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:21:40,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 05:21:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:41,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-11-28 05:21:41,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:21:41,425 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 05:21:41,425 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:21:41,528 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:21:41,650 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:21:41,650 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 05:21:41,922 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 05:21:41,927 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:21:42,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:21:42,018 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 05:21:42,040 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-28 05:21:42,040 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 34 treesize of output 36 [2024-11-28 05:21:42,378 INFO L349 Elim1Store]: treesize reduction 59, result has 37.2 percent of original size [2024-11-28 05:21:42,379 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 87 treesize of output 54 [2024-11-28 05:21:42,397 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 67 treesize of output 50 [2024-11-28 05:21:42,466 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 48 treesize of output 32 [2024-11-28 05:21:42,468 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 36 treesize of output 24 [2024-11-28 05:21:42,584 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 12 [2024-11-28 05:21:42,630 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:21:42,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:21:43,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208047694] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:21:43,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:21:43,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31] total 51 [2024-11-28 05:21:43,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788292303] [2024-11-28 05:21:43,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:21:43,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-28 05:21:43,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:43,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-28 05:21:43,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3332, Unknown=19, NotChecked=0, Total=3540 [2024-11-28 05:21:43,532 INFO L87 Difference]: Start difference. First operand 136 states and 150 transitions. Second operand has 51 states, 49 states have (on average 2.0408163265306123) internal successors, (100), 44 states have internal predecessors, (100), 4 states have call successors, (4), 3 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:21:45,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:45,992 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2024-11-28 05:21:45,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-28 05:21:45,993 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 2.0408163265306123) internal successors, (100), 44 states have internal predecessors, (100), 4 states have call successors, (4), 3 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 64 [2024-11-28 05:21:45,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:45,994 INFO L225 Difference]: With dead ends: 140 [2024-11-28 05:21:45,994 INFO L226 Difference]: Without dead ends: 140 [2024-11-28 05:21:45,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1647 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=463, Invalid=6828, Unknown=19, NotChecked=0, Total=7310 [2024-11-28 05:21:45,996 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 129 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 1693 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:45,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1290 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1693 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-28 05:21:45,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-28 05:21:46,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2024-11-28 05:21:46,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 112 states have (on average 1.2232142857142858) internal successors, (137), 127 states have internal predecessors, (137), 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 05:21:46,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2024-11-28 05:21:46,002 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 64 [2024-11-28 05:21:46,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:46,002 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2024-11-28 05:21:46,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 2.0408163265306123) internal successors, (100), 44 states have internal predecessors, (100), 4 states have call successors, (4), 3 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:21:46,002 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2024-11-28 05:21:46,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-28 05:21:46,003 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:46,003 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, 1, 1, 1] [2024-11-28 05:21:46,014 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-28 05:21:46,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:46,204 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:21:46,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:46,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1005086767, now seen corresponding path program 1 times [2024-11-28 05:21:46,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:21:46,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061576115] [2024-11-28 05:21:46,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:46,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:21:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:48,704 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 05:21:48,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:21:48,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061576115] [2024-11-28 05:21:48,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061576115] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:21:48,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815298001] [2024-11-28 05:21:48,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:48,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:48,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:21:48,707 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:21:48,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-28 05:21:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:49,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 121 conjuncts are in the unsatisfiable core [2024-11-28 05:21:49,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:21:49,174 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:21:49,583 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 05:21:49,583 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:21:49,789 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:21:49,873 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:21:49,884 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 23 treesize of output 11 [2024-11-28 05:21:50,007 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:21:50,008 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:21:50,014 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:21:50,385 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:21:50,391 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 05:21:50,395 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:21:50,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:21:50,780 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:21:50,796 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-28 05:21:50,796 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:21:50,815 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 05:21:51,420 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 40 treesize of output 16 [2024-11-28 05:21:51,677 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:21:51,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-28 05:21:51,897 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 19 treesize of output 11 [2024-11-28 05:21:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:21:52,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:22:01,205 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3206 (Array Int Int)) (v_ArrVal_3207 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)) v_ArrVal_3206) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3207) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2024-11-28 05:22:01,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815298001] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:22:01,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:22:01,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 64 [2024-11-28 05:22:01,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907142667] [2024-11-28 05:22:01,662 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:22:01,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-11-28 05:22:01,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:22:01,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-11-28 05:22:01,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=4532, Unknown=167, NotChecked=138, Total=5112 [2024-11-28 05:22:01,665 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand has 64 states, 62 states have (on average 1.967741935483871) internal successors, (122), 55 states have internal predecessors, (122), 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 05:22:04,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:22:04,946 INFO L93 Difference]: Finished difference Result 168 states and 183 transitions. [2024-11-28 05:22:04,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-28 05:22:04,947 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 62 states have (on average 1.967741935483871) internal successors, (122), 55 states have internal predecessors, (122), 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 71 [2024-11-28 05:22:04,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:22:04,948 INFO L225 Difference]: With dead ends: 168 [2024-11-28 05:22:04,948 INFO L226 Difference]: Without dead ends: 168 [2024-11-28 05:22:04,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2093 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=489, Invalid=7536, Unknown=169, NotChecked=178, Total=8372 [2024-11-28 05:22:04,950 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 111 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 2175 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1673 SdHoareTripleChecker+Invalid, 2184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:22:04,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1673 Invalid, 2184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2175 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-28 05:22:04,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-28 05:22:04,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 147. [2024-11-28 05:22:04,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 123 states have (on average 1.2113821138211383) internal successors, (149), 138 states have internal predecessors, (149), 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 05:22:04,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 159 transitions. [2024-11-28 05:22:04,956 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 159 transitions. Word has length 71 [2024-11-28 05:22:04,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:22:04,956 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 159 transitions. [2024-11-28 05:22:04,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 62 states have (on average 1.967741935483871) internal successors, (122), 55 states have internal predecessors, (122), 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 05:22:04,956 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions. [2024-11-28 05:22:04,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-28 05:22:04,957 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:22:04,957 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, 1, 1, 1] [2024-11-28 05:22:04,970 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-28 05:22:05,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-28 05:22:05,158 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:22:05,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:05,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1005077911, now seen corresponding path program 1 times [2024-11-28 05:22:05,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:05,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466106439] [2024-11-28 05:22:05,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:05,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:08,372 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:22:08,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:08,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466106439] [2024-11-28 05:22:08,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466106439] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:22:08,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402194285] [2024-11-28 05:22:08,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:08,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:08,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:08,375 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:22:08,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-28 05:22:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:08,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 126 conjuncts are in the unsatisfiable core [2024-11-28 05:22:08,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:22:08,726 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:22:09,148 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:22:09,149 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:22:09,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 13 treesize of output 9 [2024-11-28 05:22:09,324 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:22:09,504 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:22:09,504 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 83 treesize of output 74 [2024-11-28 05:22:09,516 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 30 treesize of output 13 [2024-11-28 05:22:09,925 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 79 treesize of output 23 [2024-11-28 05:22:09,930 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:22:09,937 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:22:09,941 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 05:22:10,298 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 05:22:10,299 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 05:22:10,314 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 05:22:10,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:22:10,322 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 87 treesize of output 64 [2024-11-28 05:22:10,360 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-28 05:22:10,360 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 34 treesize of output 36 [2024-11-28 05:22:10,369 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 28 treesize of output 23 [2024-11-28 05:22:11,081 INFO L349 Elim1Store]: treesize reduction 59, result has 37.2 percent of original size [2024-11-28 05:22:11,081 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 106 treesize of output 59 [2024-11-28 05:22:11,098 INFO L349 Elim1Store]: treesize reduction 71, result has 19.3 percent of original size [2024-11-28 05:22:11,098 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 40 treesize of output 33 [2024-11-28 05:22:11,301 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 86 treesize of output 63 [2024-11-28 05:22:11,342 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2024-11-28 05:22:11,343 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 63 treesize of output 80 [2024-11-28 05:22:11,550 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 84 treesize of output 60 [2024-11-28 05:22:11,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 44 [2024-11-28 05:22:11,799 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 41 treesize of output 17 [2024-11-28 05:22:11,804 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 05:22:11,957 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 05:22:11,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:22:12,439 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (forall ((v_ArrVal_3443 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3443) .cse0) .cse1) 4))) (forall ((v_ArrVal_3442 (Array Int Int)) (v_ArrVal_3443 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3443) .cse0) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3442) .cse0) .cse1)))))) is different from false [2024-11-28 05:22:14,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402194285] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:22:14,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:22:14,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 32] total 65 [2024-11-28 05:22:14,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089183887] [2024-11-28 05:22:14,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:22:14,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-11-28 05:22:14,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:22:14,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-11-28 05:22:14,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=5419, Unknown=35, NotChecked=148, Total=5852 [2024-11-28 05:22:14,229 INFO L87 Difference]: Start difference. First operand 147 states and 159 transitions. Second operand has 66 states, 63 states have (on average 2.015873015873016) internal successors, (127), 57 states have internal predecessors, (127), 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 05:22:19,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:22:19,633 INFO L93 Difference]: Finished difference Result 162 states and 175 transitions. [2024-11-28 05:22:19,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-28 05:22:19,634 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 63 states have (on average 2.015873015873016) internal successors, (127), 57 states have internal predecessors, (127), 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 71 [2024-11-28 05:22:19,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:22:19,635 INFO L225 Difference]: With dead ends: 162 [2024-11-28 05:22:19,635 INFO L226 Difference]: Without dead ends: 162 [2024-11-28 05:22:19,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1805 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=563, Invalid=10745, Unknown=38, NotChecked=210, Total=11556 [2024-11-28 05:22:19,637 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 139 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 3188 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1922 SdHoareTripleChecker+Invalid, 3199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:22:19,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1922 Invalid, 3199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3188 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-28 05:22:19,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-28 05:22:19,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 153. [2024-11-28 05:22:19,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 129 states have (on average 1.2248062015503876) internal successors, (158), 144 states have internal predecessors, (158), 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 05:22:19,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 168 transitions. [2024-11-28 05:22:19,642 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 168 transitions. Word has length 71 [2024-11-28 05:22:19,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:22:19,643 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 168 transitions. [2024-11-28 05:22:19,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 63 states have (on average 2.015873015873016) internal successors, (127), 57 states have internal predecessors, (127), 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 05:22:19,643 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 168 transitions. [2024-11-28 05:22:19,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-28 05:22:19,643 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:22:19,644 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, 1, 1, 1] [2024-11-28 05:22:19,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-28 05:22:19,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-28 05:22:19,844 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:22:19,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:19,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1005077912, now seen corresponding path program 1 times [2024-11-28 05:22:19,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:19,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935895107] [2024-11-28 05:22:19,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:19,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:21,832 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:22:21,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:21,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935895107] [2024-11-28 05:22:21,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935895107] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:22:21,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642834512] [2024-11-28 05:22:21,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:21,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:21,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:21,834 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:22:21,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-28 05:22:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:22,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-28 05:22:22,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:22:22,180 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:22:22,313 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 05:22:22,313 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:22:22,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 13 treesize of output 9 [2024-11-28 05:22:22,497 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:22:22,497 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 42 treesize of output 41 [2024-11-28 05:22:22,736 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:22:22,740 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:22:22,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:22:22,948 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:22:22,982 INFO L349 Elim1Store]: treesize reduction 90, result has 37.9 percent of original size [2024-11-28 05:22:22,982 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 40 treesize of output 69 [2024-11-28 05:22:23,348 INFO L349 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2024-11-28 05:22:23,349 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 73 treesize of output 60 [2024-11-28 05:22:23,542 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-11-28 05:22:23,542 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 114 treesize of output 98 [2024-11-28 05:22:23,570 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:22:23,828 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 164 treesize of output 116 [2024-11-28 05:22:23,870 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 115 treesize of output 87 [2024-11-28 05:22:24,434 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 93 treesize of output 51 [2024-11-28 05:22:24,804 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:22:24,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:22:25,019 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3676 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3676) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1)) is different from false [2024-11-28 05:22:29,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642834512] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:22:29,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:22:29,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 28] total 54 [2024-11-28 05:22:29,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575986226] [2024-11-28 05:22:29,605 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:22:29,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-28 05:22:29,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:22:29,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-28 05:22:29,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=3423, Unknown=50, NotChecked=118, Total=3782 [2024-11-28 05:22:29,607 INFO L87 Difference]: Start difference. First operand 153 states and 168 transitions. Second operand has 55 states, 52 states have (on average 2.230769230769231) internal successors, (116), 48 states have internal predecessors, (116), 4 states have call successors, (4), 3 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 05:22:49,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:22:49,038 INFO L93 Difference]: Finished difference Result 162 states and 174 transitions. [2024-11-28 05:22:49,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-28 05:22:49,039 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 52 states have (on average 2.230769230769231) internal successors, (116), 48 states have internal predecessors, (116), 4 states have call successors, (4), 3 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 71 [2024-11-28 05:22:49,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:22:49,040 INFO L225 Difference]: With dead ends: 162 [2024-11-28 05:22:49,040 INFO L226 Difference]: Without dead ends: 162 [2024-11-28 05:22:49,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1758 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=465, Invalid=7141, Unknown=54, NotChecked=172, Total=7832 [2024-11-28 05:22:49,041 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 171 mSDsluCounter, 1648 mSDsCounter, 0 mSdLazyCounter, 2229 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1705 SdHoareTripleChecker+Invalid, 2247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:22:49,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1705 Invalid, 2247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2229 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-28 05:22:49,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-28 05:22:49,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 153. [2024-11-28 05:22:49,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 129 states have (on average 1.2170542635658914) internal successors, (157), 144 states have internal predecessors, (157), 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 05:22:49,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 167 transitions. [2024-11-28 05:22:49,046 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 167 transitions. Word has length 71 [2024-11-28 05:22:49,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:22:49,047 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 167 transitions. [2024-11-28 05:22:49,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 52 states have (on average 2.230769230769231) internal successors, (116), 48 states have internal predecessors, (116), 4 states have call successors, (4), 3 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 05:22:49,047 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 167 transitions. [2024-11-28 05:22:49,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-28 05:22:49,048 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:22:49,048 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, 1, 1, 1] [2024-11-28 05:22:49,059 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-28 05:22:49,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-28 05:22:49,249 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:22:49,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:49,249 INFO L85 PathProgramCache]: Analyzing trace with hash -933528785, now seen corresponding path program 1 times [2024-11-28 05:22:49,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:49,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160692037] [2024-11-28 05:22:49,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:49,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-28 05:22:49,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:49,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160692037] [2024-11-28 05:22:49,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160692037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:49,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:22:49,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:22:49,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486209848] [2024-11-28 05:22:49,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:49,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:22:49,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:22:49,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:22:49,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:22:49,431 INFO L87 Difference]: Start difference. First operand 153 states and 167 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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:22:49,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:22:49,533 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2024-11-28 05:22:49,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:22:49,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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 71 [2024-11-28 05:22:49,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:22:49,535 INFO L225 Difference]: With dead ends: 157 [2024-11-28 05:22:49,535 INFO L226 Difference]: Without dead ends: 157 [2024-11-28 05:22:49,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:22:49,536 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:22:49,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 281 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:22:49,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-28 05:22:49,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2024-11-28 05:22:49,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 129 states have (on average 1.2015503875968991) internal successors, (155), 144 states have internal predecessors, (155), 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 05:22:49,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2024-11-28 05:22:49,545 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 71 [2024-11-28 05:22:49,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:22:49,545 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2024-11-28 05:22:49,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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:22:49,545 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2024-11-28 05:22:49,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 05:22:49,547 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:22:49,547 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 05:22:49,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-28 05:22:49,548 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:22:49,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:49,549 INFO L85 PathProgramCache]: Analyzing trace with hash 114963924, now seen corresponding path program 3 times [2024-11-28 05:22:49,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:49,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352625134] [2024-11-28 05:22:49,550 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 05:22:49,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:49,612 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-28 05:22:49,612 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:22:52,436 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 05:22:52,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:52,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352625134] [2024-11-28 05:22:52,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352625134] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:22:52,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454256307] [2024-11-28 05:22:52,436 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 05:22:52,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:52,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:52,438 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:22:52,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-28 05:22:53,130 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-28 05:22:53,130 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:22:53,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 138 conjuncts are in the unsatisfiable core [2024-11-28 05:22:53,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:22:53,170 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:22:53,239 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-28 05:22:53,239 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 05:22:53,633 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse0 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |c_#memory_$Pointer$#1.base|))) (and (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1)) |c_#memory_$Pointer$#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 1) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |c_#valid| .cse2)))))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |c_#valid| .cse4)))))))))) is different from false [2024-11-28 05:22:53,638 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse0 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |c_#memory_$Pointer$#1.base|))) (and (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1)) |c_#memory_$Pointer$#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 1) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |c_#valid| .cse2)))))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |c_#valid| .cse4)))))))))) is different from true [2024-11-28 05:22:53,724 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (or (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |c_#valid| .cse1)))))))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |c_#valid| .cse2)))) (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse3 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |c_#memory_$Pointer$#1.base|)) (.cse4 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3 (select |c_#memory_$Pointer$#1.base| .cse3)) |c_#memory_$Pointer$#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse4) 1))))))) (= |c_ULTIMATE.start_dll_create_~new_head~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 05:22:53,728 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (or (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |c_#valid| .cse1)))))))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |c_#valid| .cse2)))) (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse3 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |c_#memory_$Pointer$#1.base|)) (.cse4 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3 (select |c_#memory_$Pointer$#1.base| .cse3)) |c_#memory_$Pointer$#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse4) 1))))))) (= |c_ULTIMATE.start_dll_create_~new_head~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 05:22:53,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:22:53,795 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-28 05:22:53,795 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 05:22:53,817 WARN L851 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |c_#valid| .cse1)))))))) (exists ((|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int)))) (and (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_235| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse2 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2 (select |v_#memory_$Pointer$#1.base_235| .cse2)) |v_#memory_$Pointer$#1.base_235|) (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1)))) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |c_#valid| .cse4))))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~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 05:22:53,821 WARN L873 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |c_#valid| .cse1)))))))) (exists ((|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int)))) (and (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_235| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse2 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2 (select |v_#memory_$Pointer$#1.base_235| .cse2)) |v_#memory_$Pointer$#1.base_235|) (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1)))) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |c_#valid| .cse4))))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~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 05:22:53,870 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 05:22:53,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:22:53,944 INFO L349 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2024-11-28 05:22:53,945 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 05:22:53,969 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:22:53,981 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) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse4 (= (select .cse1 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse0 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse2 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse0 (select |v_#memory_$Pointer$#1.base_235| .cse0)) |v_#memory_$Pointer$#1.base_235|) (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_235| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1)) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse3 (select |c_#valid| .cse3))))))) .cse4) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_51| .cse5) 1) (= |c_#valid| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse6 (select |c_#valid| .cse6)))))) .cse4))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) is different from false [2024-11-28 05:22:53,985 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) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse4 (= (select .cse1 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse0 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse2 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse0 (select |v_#memory_$Pointer$#1.base_235| .cse0)) |v_#memory_$Pointer$#1.base_235|) (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_235| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1)) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse3 (select |c_#valid| .cse3))))))) .cse4) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_51| .cse5) 1) (= |c_#valid| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse6 (select |c_#valid| .cse6)))))) .cse4))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) is different from true [2024-11-28 05:22:54,102 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:22:54,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:22:54,138 INFO L349 Elim1Store]: treesize reduction 47, result has 26.6 percent of original size [2024-11-28 05:22:54,139 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 41 treesize of output 53 [2024-11-28 05:22:54,295 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 05:22:54,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 72 treesize of output 54 [2024-11-28 05:22:54,320 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse4 (select .cse3 4))) (let ((.cse0 (= (select |c_#valid| .cse4) 1)) (.cse6 (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 8) 0))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse2 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse4) 4))) (and (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse1 (select |v_#memory_$Pointer$#1.base_235| .cse1)) |v_#memory_$Pointer$#1.base_235|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse2) 1) (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_235| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) .cse4 (store (select |v_#memory_$Pointer$#1.base_235| .cse4) 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse5 (select |c_#valid| .cse5)))) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse4)))) .cse6) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse7 (select .cse9 4))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse8 (select |c_#valid| .cse8)))))) .cse6 (= (select .cse9 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (or (= .cse7 .cse4) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse7) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse4)))))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) is different from false [2024-11-28 05:22:54,324 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse4 (select .cse3 4))) (let ((.cse0 (= (select |c_#valid| .cse4) 1)) (.cse6 (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 8) 0))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse2 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse4) 4))) (and (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse1 (select |v_#memory_$Pointer$#1.base_235| .cse1)) |v_#memory_$Pointer$#1.base_235|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse2) 1) (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_235| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) .cse4 (store (select |v_#memory_$Pointer$#1.base_235| .cse4) 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse5 (select |c_#valid| .cse5)))) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse4)))) .cse6) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse7 (select .cse9 4))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse8 (select |c_#valid| .cse8)))))) .cse6 (= (select .cse9 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (or (= .cse7 .cse4) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse7) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse4)))))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) is different from true [2024-11-28 05:22:54,421 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse2 (select .cse4 4))) (let ((.cse0 (= (select |c_#valid| .cse2) 1)) (.cse6 (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 8) 0))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2) 4))) (and (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse1 (select |v_#memory_$Pointer$#1.base_235| .cse1)) |v_#memory_$Pointer$#1.base_235|) (= .cse2 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8))) (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= (store (store |v_#memory_$Pointer$#1.base_235| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse4) .cse2 (store (select |v_#memory_$Pointer$#1.base_235| .cse2) 8 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) |c_#memory_$Pointer$#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_51| .cse2) 1) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse5 (select |c_#valid| .cse5))))))) .cse6) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse7 (select .cse9 4))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse8 (select |c_#valid| .cse8)))))) (= (select .cse9 8) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 (or (= .cse2 .cse7) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse7) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)))))))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from false [2024-11-28 05:22:54,425 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse2 (select .cse4 4))) (let ((.cse0 (= (select |c_#valid| .cse2) 1)) (.cse6 (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 8) 0))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2) 4))) (and (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse1 (select |v_#memory_$Pointer$#1.base_235| .cse1)) |v_#memory_$Pointer$#1.base_235|) (= .cse2 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8))) (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= (store (store |v_#memory_$Pointer$#1.base_235| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse4) .cse2 (store (select |v_#memory_$Pointer$#1.base_235| .cse2) 8 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) |c_#memory_$Pointer$#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_51| .cse2) 1) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse5 (select |c_#valid| .cse5))))))) .cse6) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse7 (select .cse9 4))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse8 (select |c_#valid| .cse8)))))) (= (select .cse9 8) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 (or (= .cse2 .cse7) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse7) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)))))))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from true [2024-11-28 05:22:54,608 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse3 (select .cse4 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 8) 0)) (.cse6 (= (select |c_#valid| .cse3) 1))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse2 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) 4)) (.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|))) (and (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse1 (select |v_#memory_$Pointer$#1.base_235| .cse1)) |v_#memory_$Pointer$#1.base_235|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= .cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8))) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_235| |c_ULTIMATE.start_dll_create_#res#1.base| .cse4) .cse3 (store (select |v_#memory_$Pointer$#1.base_235| .cse3) 8 |c_ULTIMATE.start_dll_create_#res#1.base|))) (= .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse5 (select |c_#valid| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_#res#1.base|) 0)))) .cse6) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse9 (select .cse7 4))) (and (= (select .cse7 8) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse0 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= |c_#valid| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse8 (select |c_#valid| .cse8)))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) (or (= .cse9 .cse3) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse9) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse3))) .cse6))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0)) is different from false [2024-11-28 05:22:54,613 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse3 (select .cse4 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 8) 0)) (.cse6 (= (select |c_#valid| .cse3) 1))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse2 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) 4)) (.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|))) (and (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse1 (select |v_#memory_$Pointer$#1.base_235| .cse1)) |v_#memory_$Pointer$#1.base_235|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= .cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8))) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_235| |c_ULTIMATE.start_dll_create_#res#1.base| .cse4) .cse3 (store (select |v_#memory_$Pointer$#1.base_235| .cse3) 8 |c_ULTIMATE.start_dll_create_#res#1.base|))) (= .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse5 (select |c_#valid| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_#res#1.base|) 0)))) .cse6) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse9 (select .cse7 4))) (and (= (select .cse7 8) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse0 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= |c_#valid| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse8 (select |c_#valid| .cse8)))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) (or (= .cse9 .cse3) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse9) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse3))) .cse6))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0)) is different from true [2024-11-28 05:22:54,738 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (and (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse5 (select .cse6 4))) (let ((.cse1 (= (select |c_#valid| .cse5) 1)) (.cse2 (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 8) 0))) (or (and .cse1 .cse2 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse4 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse5) 4)) (.cse3 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|))) (and (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3 (select |v_#memory_$Pointer$#1.base_235| .cse3)) |v_#memory_$Pointer$#1.base_235|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse4) 1) (= .cse5 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8))) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_235| .cse0 .cse6) .cse5 (store (select |v_#memory_$Pointer$#1.base_235| .cse5) 8 .cse0))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_51| .cse5) 1) (= .cse0 .cse3) (= |c_#valid| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse7 (select |c_#valid| .cse7)))))))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse5))) (let ((.cse9 (select .cse8 4))) (and .cse1 .cse2 (= .cse0 (select .cse8 8)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_51| .cse9) 1) (= |c_#valid| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse10 (select |c_#valid| .cse10)))))) (or (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse9) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse5)) (= .cse9 .cse5))))))))))) is different from false [2024-11-28 05:22:54,743 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (and (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse5 (select .cse6 4))) (let ((.cse1 (= (select |c_#valid| .cse5) 1)) (.cse2 (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 8) 0))) (or (and .cse1 .cse2 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse4 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse5) 4)) (.cse3 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|))) (and (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3 (select |v_#memory_$Pointer$#1.base_235| .cse3)) |v_#memory_$Pointer$#1.base_235|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse4) 1) (= .cse5 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8))) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_235| .cse0 .cse6) .cse5 (store (select |v_#memory_$Pointer$#1.base_235| .cse5) 8 .cse0))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_51| .cse5) 1) (= .cse0 .cse3) (= |c_#valid| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse7 (select |c_#valid| .cse7)))))))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse5))) (let ((.cse9 (select .cse8 4))) (and .cse1 .cse2 (= .cse0 (select .cse8 8)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_51| .cse9) 1) (= |c_#valid| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse10 (select |c_#valid| .cse10)))))) (or (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse9) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse5)) (= .cse9 .cse5))))))))))) is different from true [2024-11-28 05:22:54,796 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:22:54,796 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 326 treesize of output 294 [2024-11-28 05:22:54,917 INFO L349 Elim1Store]: treesize reduction 22, result has 61.4 percent of original size [2024-11-28 05:22:54,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 103 treesize of output 65 [2024-11-28 05:22:55,145 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse2 (select (select (store (store |v_#memory_$Pointer$#1.base_235| .cse0 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33) .cse0) 4))) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 0) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse1 (select |v_#memory_$Pointer$#1.base_235| .cse1)) |v_#memory_$Pointer$#1.base_235|) (= .cse0 .cse1) (= (select |v_old(#valid)_AFTER_CALL_51| .cse2) 1) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse2) (= |v_#valid_BEFORE_CALL_48| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= v_DerPreprocessor_31 .cse2) (= (store (select |v_#memory_$Pointer$#1.base_235| .cse2) 8 .cse0) v_DerPreprocessor_33))))) (= (select |v_#valid_BEFORE_CALL_48| .cse0) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((v_arrayElimCell_194 Int)) (and (= (select |v_#valid_BEFORE_CALL_48| v_arrayElimCell_194) 1) (not (= .cse5 v_arrayElimCell_194)))) (exists ((v_prenex_39 (Array Int Int)) (v_arrayElimCell_191 Int)) (and (= (let ((.cse6 (@diff v_prenex_39 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_39 .cse6 (select |v_#valid_BEFORE_CALL_48| .cse6))) |v_#valid_BEFORE_CALL_48|) (= (select v_prenex_39 v_arrayElimCell_191) 1) (= 0 (select v_prenex_39 .cse5)))) (= (select |v_#valid_BEFORE_CALL_48| .cse5) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-28 05:22:55,153 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse2 (select (select (store (store |v_#memory_$Pointer$#1.base_235| .cse0 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33) .cse0) 4))) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 0) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse1 (select |v_#memory_$Pointer$#1.base_235| .cse1)) |v_#memory_$Pointer$#1.base_235|) (= .cse0 .cse1) (= (select |v_old(#valid)_AFTER_CALL_51| .cse2) 1) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse2) (= |v_#valid_BEFORE_CALL_48| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= v_DerPreprocessor_31 .cse2) (= (store (select |v_#memory_$Pointer$#1.base_235| .cse2) 8 .cse0) v_DerPreprocessor_33))))) (= (select |v_#valid_BEFORE_CALL_48| .cse0) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((v_arrayElimCell_194 Int)) (and (= (select |v_#valid_BEFORE_CALL_48| v_arrayElimCell_194) 1) (not (= .cse5 v_arrayElimCell_194)))) (exists ((v_prenex_39 (Array Int Int)) (v_arrayElimCell_191 Int)) (and (= (let ((.cse6 (@diff v_prenex_39 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_39 .cse6 (select |v_#valid_BEFORE_CALL_48| .cse6))) |v_#valid_BEFORE_CALL_48|) (= (select v_prenex_39 v_arrayElimCell_191) 1) (= 0 (select v_prenex_39 .cse5)))) (= (select |v_#valid_BEFORE_CALL_48| .cse5) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-28 05:22:55,285 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse2 (select (select (store (store |v_#memory_$Pointer$#1.base_235| .cse0 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33) .cse0) 4))) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 0) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse1 (select |v_#memory_$Pointer$#1.base_235| .cse1)) |v_#memory_$Pointer$#1.base_235|) (= .cse0 .cse1) (= (select |v_old(#valid)_AFTER_CALL_51| .cse2) 1) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse2) (= |v_#valid_BEFORE_CALL_48| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= v_DerPreprocessor_31 .cse2) (= (store (select |v_#memory_$Pointer$#1.base_235| .cse2) 8 .cse0) v_DerPreprocessor_33))))) (= (select |v_#valid_BEFORE_CALL_48| .cse0) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((v_arrayElimCell_194 Int)) (and (= (select |v_#valid_BEFORE_CALL_48| v_arrayElimCell_194) 1) (not (= .cse5 v_arrayElimCell_194)))) (exists ((v_prenex_39 (Array Int Int)) (v_arrayElimCell_191 Int)) (and (= (let ((.cse6 (@diff v_prenex_39 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_39 .cse6 (select |v_#valid_BEFORE_CALL_48| .cse6))) |v_#valid_BEFORE_CALL_48|) (= (select v_prenex_39 v_arrayElimCell_191) 1) (= 0 (select v_prenex_39 .cse5)))) (= (select |v_#valid_BEFORE_CALL_48| .cse5) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0)))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-28 05:22:55,291 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse2 (select (select (store (store |v_#memory_$Pointer$#1.base_235| .cse0 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33) .cse0) 4))) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 0) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse1 (select |v_#memory_$Pointer$#1.base_235| .cse1)) |v_#memory_$Pointer$#1.base_235|) (= .cse0 .cse1) (= (select |v_old(#valid)_AFTER_CALL_51| .cse2) 1) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse2) (= |v_#valid_BEFORE_CALL_48| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= v_DerPreprocessor_31 .cse2) (= (store (select |v_#memory_$Pointer$#1.base_235| .cse2) 8 .cse0) v_DerPreprocessor_33))))) (= (select |v_#valid_BEFORE_CALL_48| .cse0) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((v_arrayElimCell_194 Int)) (and (= (select |v_#valid_BEFORE_CALL_48| v_arrayElimCell_194) 1) (not (= .cse5 v_arrayElimCell_194)))) (exists ((v_prenex_39 (Array Int Int)) (v_arrayElimCell_191 Int)) (and (= (let ((.cse6 (@diff v_prenex_39 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_39 .cse6 (select |v_#valid_BEFORE_CALL_48| .cse6))) |v_#valid_BEFORE_CALL_48|) (= (select v_prenex_39 v_arrayElimCell_191) 1) (= 0 (select v_prenex_39 .cse5)))) (= (select |v_#valid_BEFORE_CALL_48| .cse5) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0)))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-28 05:22:55,598 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse2 (select (select (store (store |v_#memory_$Pointer$#1.base_235| .cse0 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33) .cse0) 4))) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 0) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse1 (select |v_#memory_$Pointer$#1.base_235| .cse1)) |v_#memory_$Pointer$#1.base_235|) (= .cse0 .cse1) (= (select |v_old(#valid)_AFTER_CALL_51| .cse2) 1) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse2) (= |v_#valid_BEFORE_CALL_48| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= v_DerPreprocessor_31 .cse2) (= (store (select |v_#memory_$Pointer$#1.base_235| .cse2) 8 .cse0) v_DerPreprocessor_33))))) (= (select |v_#valid_BEFORE_CALL_48| .cse0) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((v_arrayElimCell_194 Int)) (and (= (select |v_#valid_BEFORE_CALL_48| v_arrayElimCell_194) 1) (not (= .cse5 v_arrayElimCell_194)))) (exists ((v_prenex_39 (Array Int Int)) (v_arrayElimCell_191 Int)) (and (= (let ((.cse6 (@diff v_prenex_39 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_39 .cse6 (select |v_#valid_BEFORE_CALL_48| .cse6))) |v_#valid_BEFORE_CALL_48|) (= (select v_prenex_39 v_arrayElimCell_191) 1) (= 0 (select v_prenex_39 .cse5)))) (= (select |v_#valid_BEFORE_CALL_48| .cse5) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0)))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#1.offset|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from false [2024-11-28 05:22:55,605 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse2 (select (select (store (store |v_#memory_$Pointer$#1.base_235| .cse0 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33) .cse0) 4))) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 0) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse1 (select |v_#memory_$Pointer$#1.base_235| .cse1)) |v_#memory_$Pointer$#1.base_235|) (= .cse0 .cse1) (= (select |v_old(#valid)_AFTER_CALL_51| .cse2) 1) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse2) (= |v_#valid_BEFORE_CALL_48| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= v_DerPreprocessor_31 .cse2) (= (store (select |v_#memory_$Pointer$#1.base_235| .cse2) 8 .cse0) v_DerPreprocessor_33))))) (= (select |v_#valid_BEFORE_CALL_48| .cse0) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((v_arrayElimCell_194 Int)) (and (= (select |v_#valid_BEFORE_CALL_48| v_arrayElimCell_194) 1) (not (= .cse5 v_arrayElimCell_194)))) (exists ((v_prenex_39 (Array Int Int)) (v_arrayElimCell_191 Int)) (and (= (let ((.cse6 (@diff v_prenex_39 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_39 .cse6 (select |v_#valid_BEFORE_CALL_48| .cse6))) |v_#valid_BEFORE_CALL_48|) (= (select v_prenex_39 v_arrayElimCell_191) 1) (= 0 (select v_prenex_39 .cse5)))) (= (select |v_#valid_BEFORE_CALL_48| .cse5) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0)))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#1.offset|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from true [2024-11-28 05:22:55,889 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse2 (select (select (store (store |v_#memory_$Pointer$#1.base_235| .cse0 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33) .cse0) 4))) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 0) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse1 (select |v_#memory_$Pointer$#1.base_235| .cse1)) |v_#memory_$Pointer$#1.base_235|) (= .cse0 .cse1) (= (select |v_old(#valid)_AFTER_CALL_51| .cse2) 1) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse2) (= |v_#valid_BEFORE_CALL_48| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= v_DerPreprocessor_31 .cse2) (= (store (select |v_#memory_$Pointer$#1.base_235| .cse2) 8 .cse0) v_DerPreprocessor_33))))) (= (select |v_#valid_BEFORE_CALL_48| .cse0) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((v_arrayElimCell_194 Int)) (and (= (select |v_#valid_BEFORE_CALL_48| v_arrayElimCell_194) 1) (not (= .cse5 v_arrayElimCell_194)))) (exists ((v_prenex_39 (Array Int Int)) (v_arrayElimCell_191 Int)) (and (= (let ((.cse6 (@diff v_prenex_39 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_39 .cse6 (select |v_#valid_BEFORE_CALL_48| .cse6))) |v_#valid_BEFORE_CALL_48|) (= (select v_prenex_39 v_arrayElimCell_191) 1) (= 0 (select v_prenex_39 .cse5)))) (= (select |v_#valid_BEFORE_CALL_48| .cse5) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0)))) (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))))) is different from false [2024-11-28 05:22:55,895 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse2 (select (select (store (store |v_#memory_$Pointer$#1.base_235| .cse0 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33) .cse0) 4))) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 0) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse1 (select |v_#memory_$Pointer$#1.base_235| .cse1)) |v_#memory_$Pointer$#1.base_235|) (= .cse0 .cse1) (= (select |v_old(#valid)_AFTER_CALL_51| .cse2) 1) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse2) (= |v_#valid_BEFORE_CALL_48| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= v_DerPreprocessor_31 .cse2) (= (store (select |v_#memory_$Pointer$#1.base_235| .cse2) 8 .cse0) v_DerPreprocessor_33))))) (= (select |v_#valid_BEFORE_CALL_48| .cse0) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((v_arrayElimCell_194 Int)) (and (= (select |v_#valid_BEFORE_CALL_48| v_arrayElimCell_194) 1) (not (= .cse5 v_arrayElimCell_194)))) (exists ((v_prenex_39 (Array Int Int)) (v_arrayElimCell_191 Int)) (and (= (let ((.cse6 (@diff v_prenex_39 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_39 .cse6 (select |v_#valid_BEFORE_CALL_48| .cse6))) |v_#valid_BEFORE_CALL_48|) (= (select v_prenex_39 v_arrayElimCell_191) 1) (= 0 (select v_prenex_39 .cse5)))) (= (select |v_#valid_BEFORE_CALL_48| .cse5) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0)))) (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))))) is different from true [2024-11-28 05:22:56,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:22:56,274 INFO L349 Elim1Store]: treesize reduction 61, result has 17.6 percent of original size [2024-11-28 05:22:56,274 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 334 treesize of output 322 [2024-11-28 05:22:56,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:22:56,495 INFO L349 Elim1Store]: treesize reduction 64, result has 14.7 percent of original size [2024-11-28 05:22:56,496 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 126 treesize of output 79 [2024-11-28 05:22:57,148 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse3 (select (select (store (store |v_#memory_$Pointer$#1.base_235| .cse1 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33) .cse1) 4))) (let ((.cse2 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse4 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse1) 0) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2 (select |v_#memory_$Pointer$#1.base_235| .cse2)) |v_#memory_$Pointer$#1.base_235|) (= .cse1 .cse2) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse3) (= |v_#valid_BEFORE_CALL_48| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_51| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_51| .cse5 (select |v_#valid_BEFORE_CALL_48| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse4) 1) (= v_DerPreprocessor_31 .cse3) (= (store (select |v_#memory_$Pointer$#1.base_235| .cse3) 8 .cse1) v_DerPreprocessor_33))))) (= (select |v_#valid_BEFORE_CALL_48| .cse1) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((v_arrayElimCell_194 Int)) (and (= (select |v_#valid_BEFORE_CALL_48| v_arrayElimCell_194) 1) (not (= .cse6 v_arrayElimCell_194)))) (exists ((v_prenex_39 (Array Int Int)) (v_arrayElimCell_191 Int)) (and (= (let ((.cse7 (@diff v_prenex_39 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_39 .cse7 (select |v_#valid_BEFORE_CALL_48| .cse7))) |v_#valid_BEFORE_CALL_48|) (= (select v_prenex_39 v_arrayElimCell_191) 1) (= 0 (select v_prenex_39 .cse6)))) (= (select |v_#valid_BEFORE_CALL_48| .cse6) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0)))) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse0))) (or (exists ((|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|node_create_~temp~0#1.base| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int) (v_DerPreprocessor_38 Int)) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_38))) (let ((.cse11 (store (store |v_#memory_$Pointer$#1.base_235| .cse0 .cse14) v_DerPreprocessor_38 .cse13))) (let ((.cse9 (select (select .cse11 .cse0) 4))) (let ((.cse8 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse12 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse9) 4))) (and (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse8 (select |v_#memory_$Pointer$#1.base_235| .cse8)) |v_#memory_$Pointer$#1.base_235|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse9) 8) 0) (= (select |v_old(#valid)_AFTER_CALL_52| .cse0) 1) (= v_DerPreprocessor_38 .cse9) (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (store |v_old(#valid)_AFTER_CALL_51| .cse10 (select |v_old(#valid)_AFTER_CALL_52| .cse10))) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse9) 1) (= |c_#memory_$Pointer$#1.base| (store .cse11 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse12) 1) (= .cse0 .cse8) (= .cse13 (store (select |v_#memory_$Pointer$#1.base_235| .cse9) 8 .cse0)) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse12) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse9))))))) (let ((.cse16 (select .cse14 4))) (let ((.cse17 (select |c_#memory_$Pointer$#1.base| .cse16))) (let ((.cse15 (select .cse17 4))) (and (or (= .cse15 .cse16) (exists ((v_prenex_46 Int)) (= .cse16 (select (select |c_#memory_$Pointer$#1.base| .cse15) (+ v_prenex_46 8))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse16) 8) 0) (= .cse0 (select .cse17 8)) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 .cse15) 1) (= (select v_prenex_45 .cse0) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_52| .cse0) 1) (= (let ((.cse18 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse18 (select |v_old(#valid)_AFTER_CALL_52| .cse18))) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_52| .cse16) 1))))))))))) is different from false [2024-11-28 05:22:57,156 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse3 (select (select (store (store |v_#memory_$Pointer$#1.base_235| .cse1 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33) .cse1) 4))) (let ((.cse2 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse4 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse1) 0) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2 (select |v_#memory_$Pointer$#1.base_235| .cse2)) |v_#memory_$Pointer$#1.base_235|) (= .cse1 .cse2) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse3) (= |v_#valid_BEFORE_CALL_48| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_51| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_51| .cse5 (select |v_#valid_BEFORE_CALL_48| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse4) 1) (= v_DerPreprocessor_31 .cse3) (= (store (select |v_#memory_$Pointer$#1.base_235| .cse3) 8 .cse1) v_DerPreprocessor_33))))) (= (select |v_#valid_BEFORE_CALL_48| .cse1) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((v_arrayElimCell_194 Int)) (and (= (select |v_#valid_BEFORE_CALL_48| v_arrayElimCell_194) 1) (not (= .cse6 v_arrayElimCell_194)))) (exists ((v_prenex_39 (Array Int Int)) (v_arrayElimCell_191 Int)) (and (= (let ((.cse7 (@diff v_prenex_39 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_39 .cse7 (select |v_#valid_BEFORE_CALL_48| .cse7))) |v_#valid_BEFORE_CALL_48|) (= (select v_prenex_39 v_arrayElimCell_191) 1) (= 0 (select v_prenex_39 .cse6)))) (= (select |v_#valid_BEFORE_CALL_48| .cse6) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0)))) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse0))) (or (exists ((|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|node_create_~temp~0#1.base| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int) (v_DerPreprocessor_38 Int)) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_38))) (let ((.cse11 (store (store |v_#memory_$Pointer$#1.base_235| .cse0 .cse14) v_DerPreprocessor_38 .cse13))) (let ((.cse9 (select (select .cse11 .cse0) 4))) (let ((.cse8 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse12 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse9) 4))) (and (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse8 (select |v_#memory_$Pointer$#1.base_235| .cse8)) |v_#memory_$Pointer$#1.base_235|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse9) 8) 0) (= (select |v_old(#valid)_AFTER_CALL_52| .cse0) 1) (= v_DerPreprocessor_38 .cse9) (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (store |v_old(#valid)_AFTER_CALL_51| .cse10 (select |v_old(#valid)_AFTER_CALL_52| .cse10))) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse9) 1) (= |c_#memory_$Pointer$#1.base| (store .cse11 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse12) 1) (= .cse0 .cse8) (= .cse13 (store (select |v_#memory_$Pointer$#1.base_235| .cse9) 8 .cse0)) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse12) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse9))))))) (let ((.cse16 (select .cse14 4))) (let ((.cse17 (select |c_#memory_$Pointer$#1.base| .cse16))) (let ((.cse15 (select .cse17 4))) (and (or (= .cse15 .cse16) (exists ((v_prenex_46 Int)) (= .cse16 (select (select |c_#memory_$Pointer$#1.base| .cse15) (+ v_prenex_46 8))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse16) 8) 0) (= .cse0 (select .cse17 8)) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 .cse15) 1) (= (select v_prenex_45 .cse0) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_52| .cse0) 1) (= (let ((.cse18 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse18 (select |v_old(#valid)_AFTER_CALL_52| .cse18))) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_52| .cse16) 1))))))))))) is different from true [2024-11-28 05:22:58,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:22:58,048 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 767 treesize of output 567 [2024-11-28 05:22:58,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:22:58,208 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 198 treesize of output 222 [2024-11-28 05:23:10,263 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|))) (or (exists ((v_prenex_54 (Array Int Int)) (v_prenex_56 Int) (v_DerPreprocessor_38 Int) (v_prenex_55 (Array Int (Array Int Int))) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 (Array Int (Array Int Int)))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_38))) (let ((.cse0 (store (store v_prenex_53 |c_ULTIMATE.start_dll_append_#t~mem9#1.base| .cse6) v_DerPreprocessor_38 .cse5))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 4))) (let ((.cse1 (@diff v_prenex_55 v_prenex_53)) (.cse3 (select (select v_prenex_55 .cse2) 4))) (and (= |c_#memory_$Pointer$#1.base| (store .cse0 v_prenex_52 (select |c_#memory_$Pointer$#1.base| v_prenex_52))) (= (store v_prenex_55 .cse1 (select v_prenex_53 .cse1)) v_prenex_53) (= v_DerPreprocessor_38 .cse2) (= .cse2 (select (select v_prenex_55 .cse3) (+ v_prenex_56 8))) (= v_prenex_51 (let ((.cse4 (@diff v_prenex_54 v_prenex_51))) (store v_prenex_54 .cse4 (select v_prenex_51 .cse4)))) (= (select v_prenex_54 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 0) (= .cse5 (store (select v_prenex_53 .cse2) 8 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 8) 0) (= (select v_prenex_51 v_prenex_52) 0) (= .cse1 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (= (select v_prenex_54 .cse2) 1) (= |c_#valid| (store v_prenex_51 v_prenex_52 1)) (= (select v_prenex_51 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 1) (= (select v_prenex_54 .cse3) 1))))))) (let ((.cse8 (select .cse6 4))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse8))) (let ((.cse9 (select .cse7 4))) (and (= (select .cse7 8) |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (or (exists ((v_prenex_46 Int)) (= .cse8 (select (select |c_#memory_$Pointer$#1.base| .cse9) (+ v_prenex_46 8)))) (= .cse8 .cse9)) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_52| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 1) (= (let ((.cse10 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse10 (select |v_old(#valid)_AFTER_CALL_52| .cse10))) |v_old(#valid)_AFTER_CALL_52|) (= (select v_prenex_45 .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_52| .cse8) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 8) 0))))))) (= |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 4) 0)) is different from false [2024-11-28 05:23:10,268 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|))) (or (exists ((v_prenex_54 (Array Int Int)) (v_prenex_56 Int) (v_DerPreprocessor_38 Int) (v_prenex_55 (Array Int (Array Int Int))) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 (Array Int (Array Int Int)))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_38))) (let ((.cse0 (store (store v_prenex_53 |c_ULTIMATE.start_dll_append_#t~mem9#1.base| .cse6) v_DerPreprocessor_38 .cse5))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 4))) (let ((.cse1 (@diff v_prenex_55 v_prenex_53)) (.cse3 (select (select v_prenex_55 .cse2) 4))) (and (= |c_#memory_$Pointer$#1.base| (store .cse0 v_prenex_52 (select |c_#memory_$Pointer$#1.base| v_prenex_52))) (= (store v_prenex_55 .cse1 (select v_prenex_53 .cse1)) v_prenex_53) (= v_DerPreprocessor_38 .cse2) (= .cse2 (select (select v_prenex_55 .cse3) (+ v_prenex_56 8))) (= v_prenex_51 (let ((.cse4 (@diff v_prenex_54 v_prenex_51))) (store v_prenex_54 .cse4 (select v_prenex_51 .cse4)))) (= (select v_prenex_54 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 0) (= .cse5 (store (select v_prenex_53 .cse2) 8 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 8) 0) (= (select v_prenex_51 v_prenex_52) 0) (= .cse1 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (= (select v_prenex_54 .cse2) 1) (= |c_#valid| (store v_prenex_51 v_prenex_52 1)) (= (select v_prenex_51 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 1) (= (select v_prenex_54 .cse3) 1))))))) (let ((.cse8 (select .cse6 4))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse8))) (let ((.cse9 (select .cse7 4))) (and (= (select .cse7 8) |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (or (exists ((v_prenex_46 Int)) (= .cse8 (select (select |c_#memory_$Pointer$#1.base| .cse9) (+ v_prenex_46 8)))) (= .cse8 .cse9)) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_52| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 1) (= (let ((.cse10 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse10 (select |v_old(#valid)_AFTER_CALL_52| .cse10))) |v_old(#valid)_AFTER_CALL_52|) (= (select v_prenex_45 .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_52| .cse8) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 8) 0))))))) (= |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 4) 0)) is different from true [2024-11-28 05:23:10,414 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (or (exists ((v_prenex_54 (Array Int Int)) (v_prenex_56 Int) (v_DerPreprocessor_38 Int) (v_prenex_55 (Array Int (Array Int Int))) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 (Array Int (Array Int Int)))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_38))) (let ((.cse5 (store (store v_prenex_53 |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6) v_DerPreprocessor_38 .cse4))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse2 (@diff v_prenex_55 v_prenex_53)) (.cse0 (select (select v_prenex_55 .cse1) 4))) (and (= (select (select v_prenex_55 .cse0) (+ v_prenex_56 8)) .cse1) (= (store v_prenex_55 .cse2 (select v_prenex_53 .cse2)) v_prenex_53) (= v_DerPreprocessor_38 .cse1) (= v_prenex_51 (let ((.cse3 (@diff v_prenex_54 v_prenex_51))) (store v_prenex_54 .cse3 (select v_prenex_51 .cse3)))) (= (select v_prenex_51 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= .cse2 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select v_prenex_54 .cse1) 1) (= (store (select v_prenex_53 .cse1) 8 |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4) (= (select v_prenex_54 .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 8) 0) (= (select v_prenex_51 v_prenex_52) 0) (= (select v_prenex_54 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= (store .cse5 v_prenex_52 (select |c_#memory_$Pointer$#1.base| v_prenex_52)) |c_#memory_$Pointer$#1.base|) (= |c_#valid| (store v_prenex_51 v_prenex_52 1)))))))) (let ((.cse8 (select .cse6 4))) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse8))) (let ((.cse7 (select .cse10 4))) (and (or (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse7) (+ v_prenex_46 8)) .cse8)) (= .cse7 .cse8)) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_45 (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_52| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_52| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (let ((.cse9 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse9 (select |v_old(#valid)_AFTER_CALL_52| .cse9))) |v_old(#valid)_AFTER_CALL_52|) (= (select v_prenex_45 .cse7) 1))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse10 8)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 8) 0))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0)) is different from false [2024-11-28 05:23:10,420 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (or (exists ((v_prenex_54 (Array Int Int)) (v_prenex_56 Int) (v_DerPreprocessor_38 Int) (v_prenex_55 (Array Int (Array Int Int))) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 (Array Int (Array Int Int)))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_38))) (let ((.cse5 (store (store v_prenex_53 |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6) v_DerPreprocessor_38 .cse4))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse2 (@diff v_prenex_55 v_prenex_53)) (.cse0 (select (select v_prenex_55 .cse1) 4))) (and (= (select (select v_prenex_55 .cse0) (+ v_prenex_56 8)) .cse1) (= (store v_prenex_55 .cse2 (select v_prenex_53 .cse2)) v_prenex_53) (= v_DerPreprocessor_38 .cse1) (= v_prenex_51 (let ((.cse3 (@diff v_prenex_54 v_prenex_51))) (store v_prenex_54 .cse3 (select v_prenex_51 .cse3)))) (= (select v_prenex_51 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= .cse2 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select v_prenex_54 .cse1) 1) (= (store (select v_prenex_53 .cse1) 8 |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4) (= (select v_prenex_54 .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 8) 0) (= (select v_prenex_51 v_prenex_52) 0) (= (select v_prenex_54 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= (store .cse5 v_prenex_52 (select |c_#memory_$Pointer$#1.base| v_prenex_52)) |c_#memory_$Pointer$#1.base|) (= |c_#valid| (store v_prenex_51 v_prenex_52 1)))))))) (let ((.cse8 (select .cse6 4))) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse8))) (let ((.cse7 (select .cse10 4))) (and (or (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse7) (+ v_prenex_46 8)) .cse8)) (= .cse7 .cse8)) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_45 (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_52| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_52| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (let ((.cse9 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse9 (select |v_old(#valid)_AFTER_CALL_52| .cse9))) |v_old(#valid)_AFTER_CALL_52|) (= (select v_prenex_45 .cse7) 1))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse10 8)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 8) 0))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0)) is different from true [2024-11-28 05:23:10,576 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (or (exists ((v_prenex_54 (Array Int Int)) (v_prenex_56 Int) (v_DerPreprocessor_38 Int) (v_prenex_55 (Array Int (Array Int Int))) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 (Array Int (Array Int Int)))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_38))) (let ((.cse5 (store (store v_prenex_53 |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6) v_DerPreprocessor_38 .cse4))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse2 (@diff v_prenex_55 v_prenex_53)) (.cse0 (select (select v_prenex_55 .cse1) 4))) (and (= (select (select v_prenex_55 .cse0) (+ v_prenex_56 8)) .cse1) (= (store v_prenex_55 .cse2 (select v_prenex_53 .cse2)) v_prenex_53) (= v_DerPreprocessor_38 .cse1) (= v_prenex_51 (let ((.cse3 (@diff v_prenex_54 v_prenex_51))) (store v_prenex_54 .cse3 (select v_prenex_51 .cse3)))) (= (select v_prenex_51 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= .cse2 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select v_prenex_54 .cse1) 1) (= (store (select v_prenex_53 .cse1) 8 |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4) (= (select v_prenex_54 .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 8) 0) (= (select v_prenex_51 v_prenex_52) 0) (= (select v_prenex_54 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= (store .cse5 v_prenex_52 (select |c_#memory_$Pointer$#1.base| v_prenex_52)) |c_#memory_$Pointer$#1.base|) (= |c_#valid| (store v_prenex_51 v_prenex_52 1)))))))) (let ((.cse8 (select .cse6 4))) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse8))) (let ((.cse7 (select .cse10 4))) (and (or (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse7) (+ v_prenex_46 8)) .cse8)) (= .cse7 .cse8)) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_45 (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_52| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_52| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (let ((.cse9 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse9 (select |v_old(#valid)_AFTER_CALL_52| .cse9))) |v_old(#valid)_AFTER_CALL_52|) (= (select v_prenex_45 .cse7) 1))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse10 8)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 8) 0))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0)) is different from false [2024-11-28 05:23:10,581 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (or (exists ((v_prenex_54 (Array Int Int)) (v_prenex_56 Int) (v_DerPreprocessor_38 Int) (v_prenex_55 (Array Int (Array Int Int))) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 (Array Int (Array Int Int)))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_38))) (let ((.cse5 (store (store v_prenex_53 |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6) v_DerPreprocessor_38 .cse4))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse2 (@diff v_prenex_55 v_prenex_53)) (.cse0 (select (select v_prenex_55 .cse1) 4))) (and (= (select (select v_prenex_55 .cse0) (+ v_prenex_56 8)) .cse1) (= (store v_prenex_55 .cse2 (select v_prenex_53 .cse2)) v_prenex_53) (= v_DerPreprocessor_38 .cse1) (= v_prenex_51 (let ((.cse3 (@diff v_prenex_54 v_prenex_51))) (store v_prenex_54 .cse3 (select v_prenex_51 .cse3)))) (= (select v_prenex_51 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= .cse2 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select v_prenex_54 .cse1) 1) (= (store (select v_prenex_53 .cse1) 8 |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4) (= (select v_prenex_54 .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 8) 0) (= (select v_prenex_51 v_prenex_52) 0) (= (select v_prenex_54 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= (store .cse5 v_prenex_52 (select |c_#memory_$Pointer$#1.base| v_prenex_52)) |c_#memory_$Pointer$#1.base|) (= |c_#valid| (store v_prenex_51 v_prenex_52 1)))))))) (let ((.cse8 (select .cse6 4))) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse8))) (let ((.cse7 (select .cse10 4))) (and (or (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse7) (+ v_prenex_46 8)) .cse8)) (= .cse7 .cse8)) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_45 (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_52| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_52| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (let ((.cse9 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse9 (select |v_old(#valid)_AFTER_CALL_52| .cse9))) |v_old(#valid)_AFTER_CALL_52|) (= (select v_prenex_45 .cse7) 1))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse10 8)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 8) 0))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0)) is different from true [2024-11-28 05:23:10,796 INFO L349 Elim1Store]: treesize reduction 23, result has 11.5 percent of original size [2024-11-28 05:23:10,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 338 treesize of output 311 [2024-11-28 05:23:11,180 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_append_#t~mem11#1.offset| 0) (or (exists ((v_prenex_54 (Array Int Int)) (v_prenex_56 Int) (v_prenex_55 (Array Int (Array Int Int))) (v_DerPreprocessor_38 Int) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 (Array Int (Array Int Int)))) (let ((.cse0 (@diff v_prenex_55 v_prenex_53))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse6 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_38))) (let ((.cse5 (store (store v_prenex_53 .cse0 .cse4) v_DerPreprocessor_38 .cse6))) (let ((.cse1 (select (select .cse5 .cse0) 4))) (let ((.cse3 (select (select v_prenex_55 .cse1) 4))) (and (= (store v_prenex_55 .cse0 (select v_prenex_53 .cse0)) v_prenex_53) (= .cse1 v_DerPreprocessor_38) (= 1 (select v_prenex_51 .cse0)) (= v_prenex_51 (let ((.cse2 (@diff v_prenex_54 v_prenex_51))) (store v_prenex_54 .cse2 (select v_prenex_51 .cse2)))) (= (select v_prenex_54 .cse1) 1) (= (select v_prenex_54 .cse3) 1) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| (select .cse4 4)) (= (store .cse5 v_prenex_52 (select |c_#memory_$Pointer$#1.base| v_prenex_52)) |c_#memory_$Pointer$#1.base|) (= (select (select v_prenex_55 .cse3) (+ v_prenex_56 8)) .cse1) (= (select v_prenex_51 v_prenex_52) 0) (= (store (select v_prenex_53 .cse1) 8 .cse0) .cse6) (= 0 (select v_prenex_54 .cse0)) (= |c_#valid| (store v_prenex_51 v_prenex_52 1))))))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (exists ((v_prenex_45 (Array Int Int))) (and (= (let ((.cse7 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse7 (select |v_old(#valid)_AFTER_CALL_52| .cse7))) |v_old(#valid)_AFTER_CALL_52|) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse9))) (let ((.cse10 (select .cse8 4))) (and (= |v_ULTIMATE.start_dll_append_~last~0#1.base_50| (select .cse8 8)) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| .cse9) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= .cse10 .cse9) (= 1 (select v_prenex_45 .cse10)) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0)))))))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (exists ((v_prenex_45 (Array Int Int))) (and (= (let ((.cse11 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse11 (select |v_old(#valid)_AFTER_CALL_52| .cse11))) |v_old(#valid)_AFTER_CALL_52|) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse14 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse14))) (let ((.cse13 (select .cse12 4))) (and (= |v_ULTIMATE.start_dll_append_~last~0#1.base_50| (select .cse12 8)) (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse13) (+ v_prenex_46 8)) .cse14)) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| .cse14) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select |v_old(#valid)_AFTER_CALL_52| .cse14) 1) (= 1 (select v_prenex_45 .cse13)) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0)))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0))))) is different from false [2024-11-28 05:23:11,188 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_append_#t~mem11#1.offset| 0) (or (exists ((v_prenex_54 (Array Int Int)) (v_prenex_56 Int) (v_prenex_55 (Array Int (Array Int Int))) (v_DerPreprocessor_38 Int) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 (Array Int (Array Int Int)))) (let ((.cse0 (@diff v_prenex_55 v_prenex_53))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse6 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_38))) (let ((.cse5 (store (store v_prenex_53 .cse0 .cse4) v_DerPreprocessor_38 .cse6))) (let ((.cse1 (select (select .cse5 .cse0) 4))) (let ((.cse3 (select (select v_prenex_55 .cse1) 4))) (and (= (store v_prenex_55 .cse0 (select v_prenex_53 .cse0)) v_prenex_53) (= .cse1 v_DerPreprocessor_38) (= 1 (select v_prenex_51 .cse0)) (= v_prenex_51 (let ((.cse2 (@diff v_prenex_54 v_prenex_51))) (store v_prenex_54 .cse2 (select v_prenex_51 .cse2)))) (= (select v_prenex_54 .cse1) 1) (= (select v_prenex_54 .cse3) 1) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| (select .cse4 4)) (= (store .cse5 v_prenex_52 (select |c_#memory_$Pointer$#1.base| v_prenex_52)) |c_#memory_$Pointer$#1.base|) (= (select (select v_prenex_55 .cse3) (+ v_prenex_56 8)) .cse1) (= (select v_prenex_51 v_prenex_52) 0) (= (store (select v_prenex_53 .cse1) 8 .cse0) .cse6) (= 0 (select v_prenex_54 .cse0)) (= |c_#valid| (store v_prenex_51 v_prenex_52 1))))))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (exists ((v_prenex_45 (Array Int Int))) (and (= (let ((.cse7 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse7 (select |v_old(#valid)_AFTER_CALL_52| .cse7))) |v_old(#valid)_AFTER_CALL_52|) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse9))) (let ((.cse10 (select .cse8 4))) (and (= |v_ULTIMATE.start_dll_append_~last~0#1.base_50| (select .cse8 8)) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| .cse9) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= .cse10 .cse9) (= 1 (select v_prenex_45 .cse10)) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0)))))))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (exists ((v_prenex_45 (Array Int Int))) (and (= (let ((.cse11 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse11 (select |v_old(#valid)_AFTER_CALL_52| .cse11))) |v_old(#valid)_AFTER_CALL_52|) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse14 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse14))) (let ((.cse13 (select .cse12 4))) (and (= |v_ULTIMATE.start_dll_append_~last~0#1.base_50| (select .cse12 8)) (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse13) (+ v_prenex_46 8)) .cse14)) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| .cse14) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select |v_old(#valid)_AFTER_CALL_52| .cse14) 1) (= 1 (select v_prenex_45 .cse13)) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0)))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0))))) is different from true [2024-11-28 05:23:11,420 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (exists ((v_prenex_54 (Array Int Int)) (v_prenex_56 Int) (v_prenex_55 (Array Int (Array Int Int))) (v_DerPreprocessor_38 Int) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 (Array Int (Array Int Int)))) (let ((.cse0 (@diff v_prenex_55 v_prenex_53))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse6 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_38))) (let ((.cse4 (store (store v_prenex_53 .cse0 .cse5) v_DerPreprocessor_38 .cse6))) (let ((.cse1 (select (select .cse4 .cse0) 4))) (let ((.cse3 (select (select v_prenex_55 .cse1) 4))) (and (= (store v_prenex_55 .cse0 (select v_prenex_53 .cse0)) v_prenex_53) (= .cse1 v_DerPreprocessor_38) (= 1 (select v_prenex_51 .cse0)) (= v_prenex_51 (let ((.cse2 (@diff v_prenex_54 v_prenex_51))) (store v_prenex_54 .cse2 (select v_prenex_51 .cse2)))) (= (select v_prenex_54 .cse1) 1) (= (select v_prenex_54 .cse3) 1) (= (store .cse4 v_prenex_52 (select |c_#memory_$Pointer$#1.base| v_prenex_52)) |c_#memory_$Pointer$#1.base|) (= (select (select v_prenex_55 .cse3) (+ v_prenex_56 8)) .cse1) (= (select v_prenex_51 v_prenex_52) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse5 4)) (= (store (select v_prenex_53 .cse1) 8 .cse0) .cse6) (= 0 (select v_prenex_54 .cse0)) (= |c_#valid| (store v_prenex_51 v_prenex_52 1))))))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (exists ((v_prenex_45 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse9))) (let ((.cse8 (select .cse7 4))) (and (= |v_ULTIMATE.start_dll_append_~last~0#1.base_50| (select .cse7 8)) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= .cse8 .cse9) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse9) (= 1 (select v_prenex_45 .cse8)) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0)))))) (= (let ((.cse10 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse10 (select |v_old(#valid)_AFTER_CALL_52| .cse10))) |v_old(#valid)_AFTER_CALL_52|))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (exists ((v_prenex_45 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse13))) (let ((.cse12 (select .cse11 4))) (and (= |v_ULTIMATE.start_dll_append_~last~0#1.base_50| (select .cse11 8)) (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse12) (+ v_prenex_46 8)) .cse13)) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select |v_old(#valid)_AFTER_CALL_52| .cse13) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse13) (= 1 (select v_prenex_45 .cse12)) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0)))))) (= (let ((.cse14 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse14 (select |v_old(#valid)_AFTER_CALL_52| .cse14))) |v_old(#valid)_AFTER_CALL_52|))))))) is different from false [2024-11-28 05:23:11,426 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (exists ((v_prenex_54 (Array Int Int)) (v_prenex_56 Int) (v_prenex_55 (Array Int (Array Int Int))) (v_DerPreprocessor_38 Int) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 (Array Int (Array Int Int)))) (let ((.cse0 (@diff v_prenex_55 v_prenex_53))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse6 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_38))) (let ((.cse4 (store (store v_prenex_53 .cse0 .cse5) v_DerPreprocessor_38 .cse6))) (let ((.cse1 (select (select .cse4 .cse0) 4))) (let ((.cse3 (select (select v_prenex_55 .cse1) 4))) (and (= (store v_prenex_55 .cse0 (select v_prenex_53 .cse0)) v_prenex_53) (= .cse1 v_DerPreprocessor_38) (= 1 (select v_prenex_51 .cse0)) (= v_prenex_51 (let ((.cse2 (@diff v_prenex_54 v_prenex_51))) (store v_prenex_54 .cse2 (select v_prenex_51 .cse2)))) (= (select v_prenex_54 .cse1) 1) (= (select v_prenex_54 .cse3) 1) (= (store .cse4 v_prenex_52 (select |c_#memory_$Pointer$#1.base| v_prenex_52)) |c_#memory_$Pointer$#1.base|) (= (select (select v_prenex_55 .cse3) (+ v_prenex_56 8)) .cse1) (= (select v_prenex_51 v_prenex_52) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse5 4)) (= (store (select v_prenex_53 .cse1) 8 .cse0) .cse6) (= 0 (select v_prenex_54 .cse0)) (= |c_#valid| (store v_prenex_51 v_prenex_52 1))))))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (exists ((v_prenex_45 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse9))) (let ((.cse8 (select .cse7 4))) (and (= |v_ULTIMATE.start_dll_append_~last~0#1.base_50| (select .cse7 8)) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= .cse8 .cse9) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse9) (= 1 (select v_prenex_45 .cse8)) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0)))))) (= (let ((.cse10 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse10 (select |v_old(#valid)_AFTER_CALL_52| .cse10))) |v_old(#valid)_AFTER_CALL_52|))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (exists ((v_prenex_45 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse13))) (let ((.cse12 (select .cse11 4))) (and (= |v_ULTIMATE.start_dll_append_~last~0#1.base_50| (select .cse11 8)) (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse12) (+ v_prenex_46 8)) .cse13)) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select |v_old(#valid)_AFTER_CALL_52| .cse13) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse13) (= 1 (select v_prenex_45 .cse12)) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0)))))) (= (let ((.cse14 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse14 (select |v_old(#valid)_AFTER_CALL_52| .cse14))) |v_old(#valid)_AFTER_CALL_52|))))))) is different from true [2024-11-28 05:23:11,807 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 05:23:11,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 18 [2024-11-28 05:23:11,930 INFO L349 Elim1Store]: treesize reduction 35, result has 28.6 percent of original size [2024-11-28 05:23:11,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 39 [2024-11-28 05:23:12,021 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_arrayElimCell_212 Int) (v_arrayElimCell_214 Int) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1) (not (= v_arrayElimCell_214 v_arrayElimCell_212)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (select v_prenex_45 v_arrayElimCell_214) 0) (= (let ((.cse0 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0))) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_52| v_arrayElimCell_214) 1) (= (select |v_old(#valid)_AFTER_CALL_52| v_arrayElimCell_212) 1))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (let ((.cse1 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1))) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_52| v_arrayElimCell_210) 1) (= 0 (select v_prenex_45 v_arrayElimCell_210)))) (exists ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_prenex_54 (Array Int Int)) (v_prenex_56 Int) (v_prenex_55 (Array Int (Array Int Int))) (v_DerPreprocessor_38 Int) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 (Array Int (Array Int Int)))) (let ((.cse2 (@diff v_prenex_55 v_prenex_53))) (let ((.cse7 (store (store (store v_prenex_53 .cse2 v_DerPreprocessor_41) v_DerPreprocessor_38 v_DerPreprocessor_42) v_prenex_52 v_DerPreprocessor_43))) (let ((.cse8 (select .cse7 .cse2)) (.cse5 (select .cse7 v_DerPreprocessor_38))) (let ((.cse3 (select (select (store (store v_prenex_53 .cse2 .cse8) v_DerPreprocessor_38 .cse5) .cse2) 4))) (let ((.cse6 (select (select v_prenex_55 .cse3) 4))) (and (= (store v_prenex_55 .cse2 (select v_prenex_53 .cse2)) v_prenex_53) (= (select v_prenex_54 .cse3) 1) (= 1 (select v_prenex_51 .cse2)) (= v_prenex_51 (let ((.cse4 (@diff v_prenex_54 v_prenex_51))) (store v_prenex_54 .cse4 (select v_prenex_51 .cse4)))) (= (store (select v_prenex_53 .cse3) 8 .cse2) .cse5) (= v_DerPreprocessor_38 .cse3) (= (select (select v_prenex_55 .cse6) (+ v_prenex_56 8)) .cse3) (= (select v_prenex_51 v_prenex_52) 0) (= (select (select .cse7 (select .cse8 4)) 4) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= 0 (select v_prenex_54 .cse2)) (= |c_#valid| (store v_prenex_51 v_prenex_52 1)) (= (select v_prenex_54 .cse6) 1))))))))) is different from false [2024-11-28 05:23:12,029 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_arrayElimCell_212 Int) (v_arrayElimCell_214 Int) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1) (not (= v_arrayElimCell_214 v_arrayElimCell_212)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (select v_prenex_45 v_arrayElimCell_214) 0) (= (let ((.cse0 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0))) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_52| v_arrayElimCell_214) 1) (= (select |v_old(#valid)_AFTER_CALL_52| v_arrayElimCell_212) 1))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (let ((.cse1 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1))) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_52| v_arrayElimCell_210) 1) (= 0 (select v_prenex_45 v_arrayElimCell_210)))) (exists ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_prenex_54 (Array Int Int)) (v_prenex_56 Int) (v_prenex_55 (Array Int (Array Int Int))) (v_DerPreprocessor_38 Int) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 (Array Int (Array Int Int)))) (let ((.cse2 (@diff v_prenex_55 v_prenex_53))) (let ((.cse7 (store (store (store v_prenex_53 .cse2 v_DerPreprocessor_41) v_DerPreprocessor_38 v_DerPreprocessor_42) v_prenex_52 v_DerPreprocessor_43))) (let ((.cse8 (select .cse7 .cse2)) (.cse5 (select .cse7 v_DerPreprocessor_38))) (let ((.cse3 (select (select (store (store v_prenex_53 .cse2 .cse8) v_DerPreprocessor_38 .cse5) .cse2) 4))) (let ((.cse6 (select (select v_prenex_55 .cse3) 4))) (and (= (store v_prenex_55 .cse2 (select v_prenex_53 .cse2)) v_prenex_53) (= (select v_prenex_54 .cse3) 1) (= 1 (select v_prenex_51 .cse2)) (= v_prenex_51 (let ((.cse4 (@diff v_prenex_54 v_prenex_51))) (store v_prenex_54 .cse4 (select v_prenex_51 .cse4)))) (= (store (select v_prenex_53 .cse3) 8 .cse2) .cse5) (= v_DerPreprocessor_38 .cse3) (= (select (select v_prenex_55 .cse6) (+ v_prenex_56 8)) .cse3) (= (select v_prenex_51 v_prenex_52) 0) (= (select (select .cse7 (select .cse8 4)) 4) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= 0 (select v_prenex_54 .cse2)) (= |c_#valid| (store v_prenex_51 v_prenex_52 1)) (= (select v_prenex_54 .cse6) 1))))))))) is different from true [2024-11-28 05:23:12,182 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (let ((.cse0 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0))) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_52| v_arrayElimCell_210) 1) (= 0 (select v_prenex_45 v_arrayElimCell_210)))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_arrayElimCell_212 Int) (v_arrayElimCell_214 Int) (v_prenex_45 (Array Int Int))) (and (not (= v_arrayElimCell_214 v_arrayElimCell_212)) (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (select v_prenex_45 v_arrayElimCell_214) 0) (= (let ((.cse1 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1))) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_52| v_arrayElimCell_214) 1) (= (select |v_old(#valid)_AFTER_CALL_52| v_arrayElimCell_212) 1))) (exists ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_prenex_54 (Array Int Int)) (v_prenex_56 Int) (v_prenex_55 (Array Int (Array Int Int))) (v_DerPreprocessor_38 Int) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 (Array Int (Array Int Int)))) (let ((.cse2 (@diff v_prenex_55 v_prenex_53))) (let ((.cse6 (store (store (store v_prenex_53 .cse2 v_DerPreprocessor_41) v_DerPreprocessor_38 v_DerPreprocessor_42) v_prenex_52 v_DerPreprocessor_43))) (let ((.cse7 (select .cse6 .cse2)) (.cse5 (select .cse6 v_DerPreprocessor_38))) (let ((.cse3 (select (select (store (store v_prenex_53 .cse2 .cse7) v_DerPreprocessor_38 .cse5) .cse2) 4))) (let ((.cse8 (select (select v_prenex_55 .cse3) 4))) (and (= (store v_prenex_55 .cse2 (select v_prenex_53 .cse2)) v_prenex_53) (= (select v_prenex_54 .cse3) 1) (= 1 (select v_prenex_51 .cse2)) (= v_prenex_51 (let ((.cse4 (@diff v_prenex_54 v_prenex_51))) (store v_prenex_54 .cse4 (select v_prenex_51 .cse4)))) (= (store (select v_prenex_53 .cse3) 8 .cse2) .cse5) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select .cse6 (select .cse7 4)) 4)) (= v_DerPreprocessor_38 .cse3) (= (select (select v_prenex_55 .cse8) (+ v_prenex_56 8)) .cse3) (= (select v_prenex_51 v_prenex_52) 0) (= 0 (select v_prenex_54 .cse2)) (= |c_#valid| (store v_prenex_51 v_prenex_52 1)) (= (select v_prenex_54 .cse8) 1))))))))) is different from false [2024-11-28 05:23:16,431 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (let ((.cse0 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0))) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_52| v_arrayElimCell_210) 1) (= 0 (select v_prenex_45 v_arrayElimCell_210)))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_arrayElimCell_212 Int) (v_arrayElimCell_214 Int) (v_prenex_45 (Array Int Int))) (and (not (= v_arrayElimCell_214 v_arrayElimCell_212)) (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (select v_prenex_45 v_arrayElimCell_214) 0) (= (let ((.cse1 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1))) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_52| v_arrayElimCell_214) 1) (= (select |v_old(#valid)_AFTER_CALL_52| v_arrayElimCell_212) 1))) (exists ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_prenex_54 (Array Int Int)) (v_prenex_56 Int) (v_prenex_55 (Array Int (Array Int Int))) (v_DerPreprocessor_38 Int) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 (Array Int (Array Int Int)))) (let ((.cse2 (@diff v_prenex_55 v_prenex_53))) (let ((.cse6 (store (store (store v_prenex_53 .cse2 v_DerPreprocessor_41) v_DerPreprocessor_38 v_DerPreprocessor_42) v_prenex_52 v_DerPreprocessor_43))) (let ((.cse7 (select .cse6 .cse2)) (.cse5 (select .cse6 v_DerPreprocessor_38))) (let ((.cse3 (select (select (store (store v_prenex_53 .cse2 .cse7) v_DerPreprocessor_38 .cse5) .cse2) 4))) (let ((.cse8 (select (select v_prenex_55 .cse3) 4))) (and (= (store v_prenex_55 .cse2 (select v_prenex_53 .cse2)) v_prenex_53) (= (select v_prenex_54 .cse3) 1) (= 1 (select v_prenex_51 .cse2)) (= v_prenex_51 (let ((.cse4 (@diff v_prenex_54 v_prenex_51))) (store v_prenex_54 .cse4 (select v_prenex_51 .cse4)))) (= (store (select v_prenex_53 .cse3) 8 .cse2) .cse5) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select .cse6 (select .cse7 4)) 4)) (= v_DerPreprocessor_38 .cse3) (= (select (select v_prenex_55 .cse8) (+ v_prenex_56 8)) .cse3) (= (select v_prenex_51 v_prenex_52) 0) (= 0 (select v_prenex_54 .cse2)) (= |c_#valid| (store v_prenex_51 v_prenex_52 1)) (= (select v_prenex_54 .cse8) 1))))))))) is different from true [2024-11-28 05:23:16,433 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 28 not checked. [2024-11-28 05:23:16,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:23:17,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454256307] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:23:17,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:23:17,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 57 [2024-11-28 05:23:17,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484397603] [2024-11-28 05:23:17,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:23:17,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-28 05:23:17,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:23:17,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-28 05:23:17,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1854, Unknown=40, NotChecked=2100, Total=4160 [2024-11-28 05:23:17,173 INFO L87 Difference]: Start difference. First operand 153 states and 165 transitions. Second operand has 58 states, 55 states have (on average 1.8909090909090909) internal successors, (104), 52 states have internal predecessors, (104), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-28 05:23:18,782 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse0 (= (select |c_#valid| .cse2) 1)) (.cse1 (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (and .cse0 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) .cse1 (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (or .cse0 (= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse4 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |c_#memory_$Pointer$#1.base|))) (and (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse4 (select |c_#memory_$Pointer$#1.base| .cse4)) |c_#memory_$Pointer$#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse5 (select |c_#valid| .cse5)))))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_51| .cse2) 1) (= |c_#valid| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse6 (select |c_#valid| .cse6)))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2024-11-28 05:23:18,789 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse0 (= (select |c_#valid| .cse2) 1)) (.cse1 (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (and .cse0 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) .cse1 (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (or .cse0 (= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse4 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |c_#memory_$Pointer$#1.base|))) (and (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse4 (select |c_#memory_$Pointer$#1.base| .cse4)) |c_#memory_$Pointer$#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse5 (select |c_#valid| .cse5)))))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_51| .cse2) 1) (= |c_#valid| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse6 (select |c_#valid| .cse6)))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from true [2024-11-28 05:23:18,802 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (or (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |c_#valid| .cse1))))))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |c_#valid| .cse2)))) (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse3 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |c_#memory_$Pointer$#1.base|)) (.cse4 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3 (select |c_#memory_$Pointer$#1.base| .cse3)) |c_#memory_$Pointer$#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse4) 1))))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or (= (select |c_#valid| .cse0) 1) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) is different from false [2024-11-28 05:23:18,810 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (or (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |c_#valid| .cse1))))))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |c_#valid| .cse2)))) (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse3 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |c_#memory_$Pointer$#1.base|)) (.cse4 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3 (select |c_#memory_$Pointer$#1.base| .cse3)) |c_#memory_$Pointer$#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse4) 1))))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or (= (select |c_#valid| .cse0) 1) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) is different from true [2024-11-28 05:23:18,823 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (or (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |c_#valid| .cse1))))))) (exists ((|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int)))) (and (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_235| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse2 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2 (select |v_#memory_$Pointer$#1.base_235| .cse2)) |v_#memory_$Pointer$#1.base_235|) (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1)))) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |c_#valid| .cse4))))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or (= (select |c_#valid| .cse0) 1) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) is different from false [2024-11-28 05:23:18,831 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (or (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |c_#valid| .cse1))))))) (exists ((|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int)))) (and (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_235| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse2 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2 (select |v_#memory_$Pointer$#1.base_235| .cse2)) |v_#memory_$Pointer$#1.base_235|) (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1)))) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |c_#valid| .cse4))))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or (= (select |c_#valid| .cse0) 1) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) is different from true [2024-11-28 05:23:18,845 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse8 (select .cse1 4)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse5 (select .cse7 4)) (.cse4 (= .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (or (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse0 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse2 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse0 (select |v_#memory_$Pointer$#1.base_235| .cse0)) |v_#memory_$Pointer$#1.base_235|) (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_235| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1)) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse3 (select |c_#valid| .cse3))))))) .cse4) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_51| .cse5) 1) (= |c_#valid| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse6 (select |c_#valid| .cse6)))))) .cse4)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or (= (select |c_#valid| (select (store .cse7 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) 1) (= .cse5 .cse8)) .cse4 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0))))) is different from false [2024-11-28 05:23:18,853 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse8 (select .cse1 4)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse5 (select .cse7 4)) (.cse4 (= .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (or (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse0 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse2 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse0 (select |v_#memory_$Pointer$#1.base_235| .cse0)) |v_#memory_$Pointer$#1.base_235|) (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_235| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1)) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse3 (select |c_#valid| .cse3))))))) .cse4) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_51| .cse5) 1) (= |c_#valid| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse6 (select |c_#valid| .cse6)))))) .cse4)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or (= (select |c_#valid| (select (store .cse7 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) 1) (= .cse5 .cse8)) .cse4 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0))))) is different from true [2024-11-28 05:23:18,875 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse5 (select .cse4 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse5))) (let ((.cse1 (= (select |c_#valid| .cse5) 1)) (.cse8 (select .cse0 4))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select .cse0 (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) .cse1 (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (let ((.cse7 (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 8) 0))) (or (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse2 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse5) 4))) (and (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2 (select |v_#memory_$Pointer$#1.base_235| .cse2)) |v_#memory_$Pointer$#1.base_235|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_235| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4) .cse5 (store (select |v_#memory_$Pointer$#1.base_235| .cse5) 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse6 (select |c_#valid| .cse6)))) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse5)))) .cse7) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse9 (select |c_#valid| .cse9)))))) .cse7 (= (select .cse0 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (or (= .cse8 .cse5) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse8) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse5)))))) (= (select |c_#valid| .cse8) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)))))) is different from false [2024-11-28 05:23:18,883 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse5 (select .cse4 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse5))) (let ((.cse1 (= (select |c_#valid| .cse5) 1)) (.cse8 (select .cse0 4))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select .cse0 (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) .cse1 (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (let ((.cse7 (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 8) 0))) (or (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse2 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse5) 4))) (and (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2 (select |v_#memory_$Pointer$#1.base_235| .cse2)) |v_#memory_$Pointer$#1.base_235|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_235| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4) .cse5 (store (select |v_#memory_$Pointer$#1.base_235| .cse5) 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse6 (select |c_#valid| .cse6)))) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse5)))) .cse7) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse9 (select |c_#valid| .cse9)))))) .cse7 (= (select .cse0 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (or (= .cse8 .cse5) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse8) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse5)))))) (= (select |c_#valid| .cse8) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)))))) is different from true [2024-11-28 05:23:18,902 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse3 (select .cse5 4))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse0 (= (select |c_#valid| .cse3) 1)) (.cse8 (select .cse1 4))) (and .cse0 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= (select .cse1 (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (let ((.cse7 (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 8) 0))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse2 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse4 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) 4))) (and (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2 (select |v_#memory_$Pointer$#1.base_235| .cse2)) |v_#memory_$Pointer$#1.base_235|) (= .cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8))) (= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse4) 1) (= (store (store |v_#memory_$Pointer$#1.base_235| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse5) .cse3 (store (select |v_#memory_$Pointer$#1.base_235| .cse3) 8 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) |c_#memory_$Pointer$#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= |c_#valid| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse6 (select |c_#valid| .cse6))))))) .cse7) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse9 (select |c_#valid| .cse9)))))) (= (select .cse1 8) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 (or (= .cse3 .cse8) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= .cse3 (select (select |c_#memory_$Pointer$#1.base| .cse8) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |c_#valid| .cse8) 1)))))) is different from false [2024-11-28 05:23:18,910 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse3 (select .cse5 4))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse0 (= (select |c_#valid| .cse3) 1)) (.cse8 (select .cse1 4))) (and .cse0 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= (select .cse1 (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (let ((.cse7 (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 8) 0))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse2 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse4 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) 4))) (and (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2 (select |v_#memory_$Pointer$#1.base_235| .cse2)) |v_#memory_$Pointer$#1.base_235|) (= .cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8))) (= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse4) 1) (= (store (store |v_#memory_$Pointer$#1.base_235| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse5) .cse3 (store (select |v_#memory_$Pointer$#1.base_235| .cse3) 8 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) |c_#memory_$Pointer$#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= |c_#valid| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse6 (select |c_#valid| .cse6))))))) .cse7) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse9 (select |c_#valid| .cse9)))))) (= (select .cse1 8) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 (or (= .cse3 .cse8) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= .cse3 (select (select |c_#memory_$Pointer$#1.base| .cse8) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |c_#valid| .cse8) 1)))))) is different from true [2024-11-28 05:23:18,926 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse2 (select .cse4 4))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse0 (= (select |c_#valid| .cse2) 1)) (.cse7 (select .cse9 4))) (and .cse0 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (let ((.cse6 (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 8) 0))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2) 4))) (and (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse1 (select |v_#memory_$Pointer$#1.base_235| .cse1)) |v_#memory_$Pointer$#1.base_235|) (= .cse2 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8))) (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= (store (store |v_#memory_$Pointer$#1.base_235| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse4) .cse2 (store (select |v_#memory_$Pointer$#1.base_235| .cse2) 8 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) |c_#memory_$Pointer$#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_51| .cse2) 1) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse5 (select |c_#valid| .cse5))))))) .cse6) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse8 (select |c_#valid| .cse8)))))) (= (select .cse9 8) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 (or (= .cse2 .cse7) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse7) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |c_#valid| .cse7) 1)))))) is different from false [2024-11-28 05:23:18,934 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse2 (select .cse4 4))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse0 (= (select |c_#valid| .cse2) 1)) (.cse7 (select .cse9 4))) (and .cse0 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (let ((.cse6 (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 8) 0))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2) 4))) (and (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse1 (select |v_#memory_$Pointer$#1.base_235| .cse1)) |v_#memory_$Pointer$#1.base_235|) (= .cse2 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8))) (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= (store (store |v_#memory_$Pointer$#1.base_235| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse4) .cse2 (store (select |v_#memory_$Pointer$#1.base_235| .cse2) 8 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) |c_#memory_$Pointer$#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_51| .cse2) 1) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse5 (select |c_#valid| .cse5))))))) .cse6) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse8 (select |c_#valid| .cse8)))))) (= (select .cse9 8) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 (or (= .cse2 .cse7) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse7) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |c_#valid| .cse7) 1)))))) is different from true [2024-11-28 05:23:18,950 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse3 (select .cse4 4))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse9 (select .cse7 4)) (.cse6 (= (select |c_#valid| .cse3) 1))) (and (let ((.cse0 (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 8) 0))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse2 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) 4)) (.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|))) (and (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse1 (select |v_#memory_$Pointer$#1.base_235| .cse1)) |v_#memory_$Pointer$#1.base_235|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= .cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8))) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_235| |c_ULTIMATE.start_dll_create_#res#1.base| .cse4) .cse3 (store (select |v_#memory_$Pointer$#1.base_235| .cse3) 8 |c_ULTIMATE.start_dll_create_#res#1.base|))) (= .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse5 (select |c_#valid| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_#res#1.base|) 0)))) .cse6) (and (= (select .cse7 8) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse0 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= |c_#valid| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse8 (select |c_#valid| .cse8)))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) (or (= .cse9 .cse3) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse9) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse3))) .cse6))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0) (= (select |c_#valid| .cse9) 1) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) .cse6))))) is different from false [2024-11-28 05:23:18,958 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse3 (select .cse4 4))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse9 (select .cse7 4)) (.cse6 (= (select |c_#valid| .cse3) 1))) (and (let ((.cse0 (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 8) 0))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse2 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) 4)) (.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|))) (and (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse1 (select |v_#memory_$Pointer$#1.base_235| .cse1)) |v_#memory_$Pointer$#1.base_235|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= .cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8))) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_235| |c_ULTIMATE.start_dll_create_#res#1.base| .cse4) .cse3 (store (select |v_#memory_$Pointer$#1.base_235| .cse3) 8 |c_ULTIMATE.start_dll_create_#res#1.base|))) (= .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse5 (select |c_#valid| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_#res#1.base|) 0)))) .cse6) (and (= (select .cse7 8) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse0 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= |c_#valid| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse8 (select |c_#valid| .cse8)))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) (or (= .cse9 .cse3) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse9) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse3))) .cse6))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0) (= (select |c_#valid| .cse9) 1) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) .cse6))))) is different from true [2024-11-28 05:23:18,979 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse5 (select .cse6 4))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse5))) (let ((.cse1 (= (select |c_#valid| .cse5) 1)) (.cse9 (select .cse8 4))) (and (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) .cse1 (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (let ((.cse2 (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 8) 0))) (or (and .cse1 .cse2 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse4 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse5) 4)) (.cse3 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|))) (and (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3 (select |v_#memory_$Pointer$#1.base_235| .cse3)) |v_#memory_$Pointer$#1.base_235|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse4) 1) (= .cse5 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8))) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_235| .cse0 .cse6) .cse5 (store (select |v_#memory_$Pointer$#1.base_235| .cse5) 8 .cse0))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_51| .cse5) 1) (= .cse0 .cse3) (= |c_#valid| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse7 (select |c_#valid| .cse7)))))))) (and .cse1 .cse2 (= .cse0 (select .cse8 8)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_51| .cse9) 1) (= |c_#valid| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse10 (select |c_#valid| .cse10)))))) (or (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse9) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse5)) (= .cse9 .cse5))))) (= (select |c_#valid| .cse9) 1))))))) is different from false [2024-11-28 05:23:18,987 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse5 (select .cse6 4))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse5))) (let ((.cse1 (= (select |c_#valid| .cse5) 1)) (.cse9 (select .cse8 4))) (and (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) .cse1 (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (let ((.cse2 (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 8) 0))) (or (and .cse1 .cse2 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (let ((.cse4 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse5) 4)) (.cse3 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|))) (and (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3 (select |v_#memory_$Pointer$#1.base_235| .cse3)) |v_#memory_$Pointer$#1.base_235|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse4) 1) (= .cse5 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8))) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_235| .cse0 .cse6) .cse5 (store (select |v_#memory_$Pointer$#1.base_235| .cse5) 8 .cse0))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_51| .cse5) 1) (= .cse0 .cse3) (= |c_#valid| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse7 (select |c_#valid| .cse7)))))))) (and .cse1 .cse2 (= .cse0 (select .cse8 8)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_51| .cse9) 1) (= |c_#valid| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_51| .cse10 (select |c_#valid| .cse10)))))) (or (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse9) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse5)) (= .cse9 .cse5))))) (= (select |c_#valid| .cse9) 1))))))) is different from true [2024-11-28 05:23:19,015 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (select |c_#valid| |c_node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse2 (select (select (store (store |v_#memory_$Pointer$#1.base_235| .cse0 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33) .cse0) 4))) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 0) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse1 (select |v_#memory_$Pointer$#1.base_235| .cse1)) |v_#memory_$Pointer$#1.base_235|) (= .cse0 .cse1) (= (select |v_old(#valid)_AFTER_CALL_51| .cse2) 1) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse2) (= |v_#valid_BEFORE_CALL_48| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= v_DerPreprocessor_31 .cse2) (= (store (select |v_#memory_$Pointer$#1.base_235| .cse2) 8 .cse0) v_DerPreprocessor_33))))) (= (select |v_#valid_BEFORE_CALL_48| .cse0) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((v_arrayElimCell_194 Int)) (and (= (select |v_#valid_BEFORE_CALL_48| v_arrayElimCell_194) 1) (not (= .cse5 v_arrayElimCell_194)))) (exists ((v_prenex_39 (Array Int Int)) (v_arrayElimCell_191 Int)) (and (= (let ((.cse6 (@diff v_prenex_39 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_39 .cse6 (select |v_#valid_BEFORE_CALL_48| .cse6))) |v_#valid_BEFORE_CALL_48|) (= (select v_prenex_39 v_arrayElimCell_191) 1) (= 0 (select v_prenex_39 .cse5)))) (= (select |v_#valid_BEFORE_CALL_48| .cse5) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0)))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-28 05:23:19,025 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (select |c_#valid| |c_node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse2 (select (select (store (store |v_#memory_$Pointer$#1.base_235| .cse0 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33) .cse0) 4))) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 0) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse1 (select |v_#memory_$Pointer$#1.base_235| .cse1)) |v_#memory_$Pointer$#1.base_235|) (= .cse0 .cse1) (= (select |v_old(#valid)_AFTER_CALL_51| .cse2) 1) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse2) (= |v_#valid_BEFORE_CALL_48| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= v_DerPreprocessor_31 .cse2) (= (store (select |v_#memory_$Pointer$#1.base_235| .cse2) 8 .cse0) v_DerPreprocessor_33))))) (= (select |v_#valid_BEFORE_CALL_48| .cse0) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((v_arrayElimCell_194 Int)) (and (= (select |v_#valid_BEFORE_CALL_48| v_arrayElimCell_194) 1) (not (= .cse5 v_arrayElimCell_194)))) (exists ((v_prenex_39 (Array Int Int)) (v_arrayElimCell_191 Int)) (and (= (let ((.cse6 (@diff v_prenex_39 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_39 .cse6 (select |v_#valid_BEFORE_CALL_48| .cse6))) |v_#valid_BEFORE_CALL_48|) (= (select v_prenex_39 v_arrayElimCell_191) 1) (= 0 (select v_prenex_39 .cse5)))) (= (select |v_#valid_BEFORE_CALL_48| .cse5) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0)))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-28 05:23:19,059 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse2 (select (select (store (store |v_#memory_$Pointer$#1.base_235| .cse0 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33) .cse0) 4))) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 0) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse1 (select |v_#memory_$Pointer$#1.base_235| .cse1)) |v_#memory_$Pointer$#1.base_235|) (= .cse0 .cse1) (= (select |v_old(#valid)_AFTER_CALL_51| .cse2) 1) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse2) (= |v_#valid_BEFORE_CALL_48| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= v_DerPreprocessor_31 .cse2) (= (store (select |v_#memory_$Pointer$#1.base_235| .cse2) 8 .cse0) v_DerPreprocessor_33))))) (= (select |v_#valid_BEFORE_CALL_48| .cse0) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((v_arrayElimCell_194 Int)) (and (= (select |v_#valid_BEFORE_CALL_48| v_arrayElimCell_194) 1) (not (= .cse5 v_arrayElimCell_194)))) (exists ((v_prenex_39 (Array Int Int)) (v_arrayElimCell_191 Int)) (and (= (let ((.cse6 (@diff v_prenex_39 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_39 .cse6 (select |v_#valid_BEFORE_CALL_48| .cse6))) |v_#valid_BEFORE_CALL_48|) (= (select v_prenex_39 v_arrayElimCell_191) 1) (= 0 (select v_prenex_39 .cse5)))) (= (select |v_#valid_BEFORE_CALL_48| .cse5) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0)))) (= |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$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#1.offset|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from false [2024-11-28 05:23:19,068 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse2 (select (select (store (store |v_#memory_$Pointer$#1.base_235| .cse0 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33) .cse0) 4))) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 0) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse1 (select |v_#memory_$Pointer$#1.base_235| .cse1)) |v_#memory_$Pointer$#1.base_235|) (= .cse0 .cse1) (= (select |v_old(#valid)_AFTER_CALL_51| .cse2) 1) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse2) (= |v_#valid_BEFORE_CALL_48| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= v_DerPreprocessor_31 .cse2) (= (store (select |v_#memory_$Pointer$#1.base_235| .cse2) 8 .cse0) v_DerPreprocessor_33))))) (= (select |v_#valid_BEFORE_CALL_48| .cse0) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((v_arrayElimCell_194 Int)) (and (= (select |v_#valid_BEFORE_CALL_48| v_arrayElimCell_194) 1) (not (= .cse5 v_arrayElimCell_194)))) (exists ((v_prenex_39 (Array Int Int)) (v_arrayElimCell_191 Int)) (and (= (let ((.cse6 (@diff v_prenex_39 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_39 .cse6 (select |v_#valid_BEFORE_CALL_48| .cse6))) |v_#valid_BEFORE_CALL_48|) (= (select v_prenex_39 v_arrayElimCell_191) 1) (= 0 (select v_prenex_39 .cse5)))) (= (select |v_#valid_BEFORE_CALL_48| .cse5) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0)))) (= |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$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#1.offset|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from true [2024-11-28 05:23:19,095 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse2 (select (select (store (store |v_#memory_$Pointer$#1.base_235| .cse0 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33) .cse0) 4))) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 0) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse1 (select |v_#memory_$Pointer$#1.base_235| .cse1)) |v_#memory_$Pointer$#1.base_235|) (= .cse0 .cse1) (= (select |v_old(#valid)_AFTER_CALL_51| .cse2) 1) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse2) (= |v_#valid_BEFORE_CALL_48| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= v_DerPreprocessor_31 .cse2) (= (store (select |v_#memory_$Pointer$#1.base_235| .cse2) 8 .cse0) v_DerPreprocessor_33))))) (= (select |v_#valid_BEFORE_CALL_48| .cse0) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((v_arrayElimCell_194 Int)) (and (= (select |v_#valid_BEFORE_CALL_48| v_arrayElimCell_194) 1) (not (= .cse5 v_arrayElimCell_194)))) (exists ((v_prenex_39 (Array Int Int)) (v_arrayElimCell_191 Int)) (and (= (let ((.cse6 (@diff v_prenex_39 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_39 .cse6 (select |v_#valid_BEFORE_CALL_48| .cse6))) |v_#valid_BEFORE_CALL_48|) (= (select v_prenex_39 v_arrayElimCell_191) 1) (= 0 (select v_prenex_39 .cse5)))) (= (select |v_#valid_BEFORE_CALL_48| .cse5) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0)))) (= |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$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#1.offset|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))))) is different from false [2024-11-28 05:23:19,104 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse2 (select (select (store (store |v_#memory_$Pointer$#1.base_235| .cse0 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33) .cse0) 4))) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 0) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse1 (select |v_#memory_$Pointer$#1.base_235| .cse1)) |v_#memory_$Pointer$#1.base_235|) (= .cse0 .cse1) (= (select |v_old(#valid)_AFTER_CALL_51| .cse2) 1) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse2) (= |v_#valid_BEFORE_CALL_48| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= v_DerPreprocessor_31 .cse2) (= (store (select |v_#memory_$Pointer$#1.base_235| .cse2) 8 .cse0) v_DerPreprocessor_33))))) (= (select |v_#valid_BEFORE_CALL_48| .cse0) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((v_arrayElimCell_194 Int)) (and (= (select |v_#valid_BEFORE_CALL_48| v_arrayElimCell_194) 1) (not (= .cse5 v_arrayElimCell_194)))) (exists ((v_prenex_39 (Array Int Int)) (v_arrayElimCell_191 Int)) (and (= (let ((.cse6 (@diff v_prenex_39 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_39 .cse6 (select |v_#valid_BEFORE_CALL_48| .cse6))) |v_#valid_BEFORE_CALL_48|) (= (select v_prenex_39 v_arrayElimCell_191) 1) (= 0 (select v_prenex_39 .cse5)))) (= (select |v_#valid_BEFORE_CALL_48| .cse5) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0)))) (= |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$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#1.offset|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))))) is different from true [2024-11-28 05:23:19,295 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse19 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse1 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (let ((.cse20 (store |c_old(#memory_$Pointer$#1.base)| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1))) (.cse16 (store |c_old(#memory_$Pointer$#1.offset)| .cse19 (select |c_#memory_$Pointer$#1.offset| .cse19)))) (let ((.cse15 (@diff .cse16 |c_#memory_$Pointer$#1.offset|)) (.cse17 (@diff .cse20 |c_#memory_$Pointer$#1.base|))) (let ((.cse5 (store .cse20 .cse17 (select |c_#memory_$Pointer$#1.base| .cse17))) (.cse18 (@diff |c_old(#valid)| |c_#valid|)) (.cse3 (store .cse16 .cse15 (select |c_#memory_$Pointer$#1.offset| .cse15)))) (let ((.cse2 (@diff .cse3 |c_#memory_$Pointer$#1.offset|)) (.cse7 (= |c_#memory_$Pointer$#1.base| .cse20)) (.cse6 (select |c_#valid| .cse18)) (.cse0 (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) (.cse4 (@diff .cse5 |c_#memory_$Pointer$#1.base|))) (and (or .cse0 (= .cse1 |c_node_create_#res#1.base|)) (or (= (select |c_old(#valid)| .cse2) 0) (= |c_#memory_$Pointer$#1.offset| .cse3)) (= |c_node_create_#res#1.offset| 0) (or (= (select |c_old(#valid)| .cse4) 0) (= |c_#memory_$Pointer$#1.base| .cse5)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (or (= |c_#valid| |c_old(#valid)|) (= .cse6 1)) .cse7 (= |c_#memory_$Pointer$#1.offset| (store .cse3 .cse2 (select |c_#memory_$Pointer$#1.offset| .cse2))) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse10 (select (select (store (store |v_#memory_$Pointer$#1.base_235| .cse8 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33) .cse8) 4))) (let ((.cse9 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse11 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse10) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse8) 0) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse9 (select |v_#memory_$Pointer$#1.base_235| .cse9)) |v_#memory_$Pointer$#1.base_235|) (= .cse8 .cse9) (= (select |v_old(#valid)_AFTER_CALL_51| .cse10) 1) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse11) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse10) (= |v_#valid_BEFORE_CALL_48| (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_51| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_51| .cse12 (select |v_#valid_BEFORE_CALL_48| .cse12)))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse11) 1) (= v_DerPreprocessor_31 .cse10) (= (store (select |v_#memory_$Pointer$#1.base_235| .cse10) 8 .cse8) v_DerPreprocessor_33))))) (= (select |v_#valid_BEFORE_CALL_48| .cse8) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((v_arrayElimCell_194 Int)) (and (= (select |v_#valid_BEFORE_CALL_48| v_arrayElimCell_194) 1) (not (= .cse13 v_arrayElimCell_194)))) (exists ((v_prenex_39 (Array Int Int)) (v_arrayElimCell_191 Int)) (and (= (let ((.cse14 (@diff v_prenex_39 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_39 .cse14 (select |v_#valid_BEFORE_CALL_48| .cse14))) |v_#valid_BEFORE_CALL_48|) (= (select v_prenex_39 v_arrayElimCell_191) 1) (= 0 (select v_prenex_39 .cse13)))) (= (select |v_#valid_BEFORE_CALL_48| .cse13) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0)))) (or (= (select |c_old(#valid)| .cse15) 0) (= |c_#memory_$Pointer$#1.offset| .cse16)) (or (= (select |c_old(#valid)| .cse17) 0) .cse7) (= |c_#valid| (store |c_old(#valid)| .cse18 .cse6)) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse19) 0)) (or (= (select |c_old(#valid)| .cse1) 0) .cse0) (= (store .cse5 .cse4 (select |c_#memory_$Pointer$#1.base| .cse4)) |c_#memory_$Pointer$#1.base|) (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))))))))) is different from false [2024-11-28 05:23:21,084 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse19 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse1 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (let ((.cse20 (store |c_old(#memory_$Pointer$#1.base)| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1))) (.cse16 (store |c_old(#memory_$Pointer$#1.offset)| .cse19 (select |c_#memory_$Pointer$#1.offset| .cse19)))) (let ((.cse15 (@diff .cse16 |c_#memory_$Pointer$#1.offset|)) (.cse17 (@diff .cse20 |c_#memory_$Pointer$#1.base|))) (let ((.cse5 (store .cse20 .cse17 (select |c_#memory_$Pointer$#1.base| .cse17))) (.cse18 (@diff |c_old(#valid)| |c_#valid|)) (.cse3 (store .cse16 .cse15 (select |c_#memory_$Pointer$#1.offset| .cse15)))) (let ((.cse2 (@diff .cse3 |c_#memory_$Pointer$#1.offset|)) (.cse7 (= |c_#memory_$Pointer$#1.base| .cse20)) (.cse6 (select |c_#valid| .cse18)) (.cse0 (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) (.cse4 (@diff .cse5 |c_#memory_$Pointer$#1.base|))) (and (or .cse0 (= .cse1 |c_node_create_#res#1.base|)) (or (= (select |c_old(#valid)| .cse2) 0) (= |c_#memory_$Pointer$#1.offset| .cse3)) (= |c_node_create_#res#1.offset| 0) (or (= (select |c_old(#valid)| .cse4) 0) (= |c_#memory_$Pointer$#1.base| .cse5)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (or (= |c_#valid| |c_old(#valid)|) (= .cse6 1)) .cse7 (= |c_#memory_$Pointer$#1.offset| (store .cse3 .cse2 (select |c_#memory_$Pointer$#1.offset| .cse2))) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse10 (select (select (store (store |v_#memory_$Pointer$#1.base_235| .cse8 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33) .cse8) 4))) (let ((.cse9 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse11 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse10) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse8) 0) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse9 (select |v_#memory_$Pointer$#1.base_235| .cse9)) |v_#memory_$Pointer$#1.base_235|) (= .cse8 .cse9) (= (select |v_old(#valid)_AFTER_CALL_51| .cse10) 1) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse11) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse10) (= |v_#valid_BEFORE_CALL_48| (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_51| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_51| .cse12 (select |v_#valid_BEFORE_CALL_48| .cse12)))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse11) 1) (= v_DerPreprocessor_31 .cse10) (= (store (select |v_#memory_$Pointer$#1.base_235| .cse10) 8 .cse8) v_DerPreprocessor_33))))) (= (select |v_#valid_BEFORE_CALL_48| .cse8) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((v_arrayElimCell_194 Int)) (and (= (select |v_#valid_BEFORE_CALL_48| v_arrayElimCell_194) 1) (not (= .cse13 v_arrayElimCell_194)))) (exists ((v_prenex_39 (Array Int Int)) (v_arrayElimCell_191 Int)) (and (= (let ((.cse14 (@diff v_prenex_39 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_39 .cse14 (select |v_#valid_BEFORE_CALL_48| .cse14))) |v_#valid_BEFORE_CALL_48|) (= (select v_prenex_39 v_arrayElimCell_191) 1) (= 0 (select v_prenex_39 .cse13)))) (= (select |v_#valid_BEFORE_CALL_48| .cse13) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0)))) (or (= (select |c_old(#valid)| .cse15) 0) (= |c_#memory_$Pointer$#1.offset| .cse16)) (or (= (select |c_old(#valid)| .cse17) 0) .cse7) (= |c_#valid| (store |c_old(#valid)| .cse18 .cse6)) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse19) 0)) (or (= (select |c_old(#valid)| .cse1) 0) .cse0) (= (store .cse5 .cse4 (select |c_#memory_$Pointer$#1.base| .cse4)) |c_#memory_$Pointer$#1.base|) (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))))))))) is different from true [2024-11-28 05:23:21,624 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse16 (select .cse14 4))) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| .cse16))) (let ((.cse17 (select .cse18 4))) (let ((.cse15 (= .cse17 .cse16))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse3 (select (select (store (store |v_#memory_$Pointer$#1.base_235| .cse1 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33) .cse1) 4))) (let ((.cse2 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse4 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse1) 0) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2 (select |v_#memory_$Pointer$#1.base_235| .cse2)) |v_#memory_$Pointer$#1.base_235|) (= .cse1 .cse2) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse3) (= |v_#valid_BEFORE_CALL_48| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_51| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_51| .cse5 (select |v_#valid_BEFORE_CALL_48| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse4) 1) (= v_DerPreprocessor_31 .cse3) (= (store (select |v_#memory_$Pointer$#1.base_235| .cse3) 8 .cse1) v_DerPreprocessor_33))))) (= (select |v_#valid_BEFORE_CALL_48| .cse1) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((v_arrayElimCell_194 Int)) (and (= (select |v_#valid_BEFORE_CALL_48| v_arrayElimCell_194) 1) (not (= .cse6 v_arrayElimCell_194)))) (exists ((v_prenex_39 (Array Int Int)) (v_arrayElimCell_191 Int)) (and (= (let ((.cse7 (@diff v_prenex_39 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_39 .cse7 (select |v_#valid_BEFORE_CALL_48| .cse7))) |v_#valid_BEFORE_CALL_48|) (= (select v_prenex_39 v_arrayElimCell_191) 1) (= 0 (select v_prenex_39 .cse6)))) (= (select |v_#valid_BEFORE_CALL_48| .cse6) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0)))) (or (exists ((|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|node_create_~temp~0#1.base| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int) (v_DerPreprocessor_38 Int)) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_38))) (let ((.cse11 (store (store |v_#memory_$Pointer$#1.base_235| .cse0 .cse14) v_DerPreprocessor_38 .cse13))) (let ((.cse9 (select (select .cse11 .cse0) 4))) (let ((.cse8 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse12 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse9) 4))) (and (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse8 (select |v_#memory_$Pointer$#1.base_235| .cse8)) |v_#memory_$Pointer$#1.base_235|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse9) 8) 0) (= (select |v_old(#valid)_AFTER_CALL_52| .cse0) 1) (= v_DerPreprocessor_38 .cse9) (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (store |v_old(#valid)_AFTER_CALL_51| .cse10 (select |v_old(#valid)_AFTER_CALL_52| .cse10))) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse9) 1) (= |c_#memory_$Pointer$#1.base| (store .cse11 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse12) 1) (= .cse0 .cse8) (= .cse13 (store (select |v_#memory_$Pointer$#1.base_235| .cse9) 8 .cse0)) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse12) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse9))))))) (and (or .cse15 (exists ((v_prenex_46 Int)) (= .cse16 (select (select |c_#memory_$Pointer$#1.base| .cse17) (+ v_prenex_46 8))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse16) 8) 0) (= .cse0 (select .cse18 8)) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 .cse17) 1) (= (select v_prenex_45 .cse0) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_52| .cse0) 1) (= (let ((.cse19 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse19 (select |v_old(#valid)_AFTER_CALL_52| .cse19))) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_52| .cse16) 1))))) (or (= .cse17 .cse0) .cse15 (= (select |c_#valid| .cse17) 1))))))))) is different from false [2024-11-28 05:23:21,636 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse16 (select .cse14 4))) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| .cse16))) (let ((.cse17 (select .cse18 4))) (let ((.cse15 (= .cse17 .cse16))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse3 (select (select (store (store |v_#memory_$Pointer$#1.base_235| .cse1 v_DerPreprocessor_32) v_DerPreprocessor_31 v_DerPreprocessor_33) .cse1) 4))) (let ((.cse2 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse4 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse3) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_51| .cse1) 0) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse2 (select |v_#memory_$Pointer$#1.base_235| .cse2)) |v_#memory_$Pointer$#1.base_235|) (= .cse1 .cse2) (= (select |v_old(#valid)_AFTER_CALL_51| .cse3) 1) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse3) (= |v_#valid_BEFORE_CALL_48| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_51| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_51| .cse5 (select |v_#valid_BEFORE_CALL_48| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse4) 1) (= v_DerPreprocessor_31 .cse3) (= (store (select |v_#memory_$Pointer$#1.base_235| .cse3) 8 .cse1) v_DerPreprocessor_33))))) (= (select |v_#valid_BEFORE_CALL_48| .cse1) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_#valid_BEFORE_CALL_48| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|))) (and (exists ((v_arrayElimCell_194 Int)) (and (= (select |v_#valid_BEFORE_CALL_48| v_arrayElimCell_194) 1) (not (= .cse6 v_arrayElimCell_194)))) (exists ((v_prenex_39 (Array Int Int)) (v_arrayElimCell_191 Int)) (and (= (let ((.cse7 (@diff v_prenex_39 |v_#valid_BEFORE_CALL_48|))) (store v_prenex_39 .cse7 (select |v_#valid_BEFORE_CALL_48| .cse7))) |v_#valid_BEFORE_CALL_48|) (= (select v_prenex_39 v_arrayElimCell_191) 1) (= 0 (select v_prenex_39 .cse6)))) (= (select |v_#valid_BEFORE_CALL_48| .cse6) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_8|) 0)))) (or (exists ((|v_#memory_$Pointer$#1.base_235| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_18| (Array Int (Array Int Int))) (|node_create_~temp~0#1.base| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_31| Int) (v_DerPreprocessor_38 Int)) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_38))) (let ((.cse11 (store (store |v_#memory_$Pointer$#1.base_235| .cse0 .cse14) v_DerPreprocessor_38 .cse13))) (let ((.cse9 (select (select .cse11 .cse0) 4))) (let ((.cse8 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| |v_#memory_$Pointer$#1.base_235|)) (.cse12 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse9) 4))) (and (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse8 (select |v_#memory_$Pointer$#1.base_235| .cse8)) |v_#memory_$Pointer$#1.base_235|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse9) 8) 0) (= (select |v_old(#valid)_AFTER_CALL_52| .cse0) 1) (= v_DerPreprocessor_38 .cse9) (= (select |v_old(#valid)_AFTER_CALL_51| .cse0) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (store |v_old(#valid)_AFTER_CALL_51| .cse10 (select |v_old(#valid)_AFTER_CALL_52| .cse10))) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| .cse9) 1) (= |c_#memory_$Pointer$#1.base| (store .cse11 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= (select |v_old(#valid)_AFTER_CALL_51| .cse12) 1) (= .cse0 .cse8) (= .cse13 (store (select |v_#memory_$Pointer$#1.base_235| .cse9) 8 .cse0)) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_18| .cse12) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_31| 8)) .cse9))))))) (and (or .cse15 (exists ((v_prenex_46 Int)) (= .cse16 (select (select |c_#memory_$Pointer$#1.base| .cse17) (+ v_prenex_46 8))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse16) 8) 0) (= .cse0 (select .cse18 8)) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 .cse17) 1) (= (select v_prenex_45 .cse0) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_52| .cse0) 1) (= (let ((.cse19 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse19 (select |v_old(#valid)_AFTER_CALL_52| .cse19))) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_52| .cse16) 1))))) (or (= .cse17 .cse0) .cse15 (= (select |c_#valid| .cse17) 1))))))))) is different from true [2024-11-28 05:23:21,663 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|))) (let ((.cse8 (select .cse6 4))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse8))) (let ((.cse9 (select .cse7 4))) (let ((.cse10 (= .cse8 .cse9))) (and (or (exists ((v_prenex_54 (Array Int Int)) (v_prenex_56 Int) (v_DerPreprocessor_38 Int) (v_prenex_55 (Array Int (Array Int Int))) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 (Array Int (Array Int Int)))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_38))) (let ((.cse0 (store (store v_prenex_53 |c_ULTIMATE.start_dll_append_#t~mem9#1.base| .cse6) v_DerPreprocessor_38 .cse5))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 4))) (let ((.cse1 (@diff v_prenex_55 v_prenex_53)) (.cse3 (select (select v_prenex_55 .cse2) 4))) (and (= |c_#memory_$Pointer$#1.base| (store .cse0 v_prenex_52 (select |c_#memory_$Pointer$#1.base| v_prenex_52))) (= (store v_prenex_55 .cse1 (select v_prenex_53 .cse1)) v_prenex_53) (= v_DerPreprocessor_38 .cse2) (= .cse2 (select (select v_prenex_55 .cse3) (+ v_prenex_56 8))) (= v_prenex_51 (let ((.cse4 (@diff v_prenex_54 v_prenex_51))) (store v_prenex_54 .cse4 (select v_prenex_51 .cse4)))) (= (select v_prenex_54 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 0) (= .cse5 (store (select v_prenex_53 .cse2) 8 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 8) 0) (= (select v_prenex_51 v_prenex_52) 0) (= .cse1 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (= (select v_prenex_54 .cse2) 1) (= |c_#valid| (store v_prenex_51 v_prenex_52 1)) (= (select v_prenex_51 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 1) (= (select v_prenex_54 .cse3) 1))))))) (and (= (select .cse7 8) |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (or (exists ((v_prenex_46 Int)) (= .cse8 (select (select |c_#memory_$Pointer$#1.base| .cse9) (+ v_prenex_46 8)))) .cse10) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_52| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 1) (= (let ((.cse11 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse11 (select |v_old(#valid)_AFTER_CALL_52| .cse11))) |v_old(#valid)_AFTER_CALL_52|) (= (select v_prenex_45 .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_52| .cse8) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 8) 0))) (or (= (select |c_#valid| .cse9) 1) (= .cse9 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse10) (= |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 4) 0))))))) is different from false [2024-11-28 05:23:21,670 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|))) (let ((.cse8 (select .cse6 4))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse8))) (let ((.cse9 (select .cse7 4))) (let ((.cse10 (= .cse8 .cse9))) (and (or (exists ((v_prenex_54 (Array Int Int)) (v_prenex_56 Int) (v_DerPreprocessor_38 Int) (v_prenex_55 (Array Int (Array Int Int))) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 (Array Int (Array Int Int)))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_38))) (let ((.cse0 (store (store v_prenex_53 |c_ULTIMATE.start_dll_append_#t~mem9#1.base| .cse6) v_DerPreprocessor_38 .cse5))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 4))) (let ((.cse1 (@diff v_prenex_55 v_prenex_53)) (.cse3 (select (select v_prenex_55 .cse2) 4))) (and (= |c_#memory_$Pointer$#1.base| (store .cse0 v_prenex_52 (select |c_#memory_$Pointer$#1.base| v_prenex_52))) (= (store v_prenex_55 .cse1 (select v_prenex_53 .cse1)) v_prenex_53) (= v_DerPreprocessor_38 .cse2) (= .cse2 (select (select v_prenex_55 .cse3) (+ v_prenex_56 8))) (= v_prenex_51 (let ((.cse4 (@diff v_prenex_54 v_prenex_51))) (store v_prenex_54 .cse4 (select v_prenex_51 .cse4)))) (= (select v_prenex_54 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 0) (= .cse5 (store (select v_prenex_53 .cse2) 8 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 8) 0) (= (select v_prenex_51 v_prenex_52) 0) (= .cse1 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (= (select v_prenex_54 .cse2) 1) (= |c_#valid| (store v_prenex_51 v_prenex_52 1)) (= (select v_prenex_51 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 1) (= (select v_prenex_54 .cse3) 1))))))) (and (= (select .cse7 8) |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (or (exists ((v_prenex_46 Int)) (= .cse8 (select (select |c_#memory_$Pointer$#1.base| .cse9) (+ v_prenex_46 8)))) .cse10) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_52| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 1) (= (let ((.cse11 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse11 (select |v_old(#valid)_AFTER_CALL_52| .cse11))) |v_old(#valid)_AFTER_CALL_52|) (= (select v_prenex_45 .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_52| .cse8) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 8) 0))) (or (= (select |c_#valid| .cse9) 1) (= .cse9 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse10) (= |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 4) 0))))))) is different from true [2024-11-28 05:23:21,689 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (let ((.cse8 (select .cse6 4))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse8))) (let ((.cse7 (select .cse11 4))) (let ((.cse9 (= .cse7 .cse8))) (and (or (exists ((v_prenex_54 (Array Int Int)) (v_prenex_56 Int) (v_DerPreprocessor_38 Int) (v_prenex_55 (Array Int (Array Int Int))) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 (Array Int (Array Int Int)))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_38))) (let ((.cse5 (store (store v_prenex_53 |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6) v_DerPreprocessor_38 .cse4))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse2 (@diff v_prenex_55 v_prenex_53)) (.cse0 (select (select v_prenex_55 .cse1) 4))) (and (= (select (select v_prenex_55 .cse0) (+ v_prenex_56 8)) .cse1) (= (store v_prenex_55 .cse2 (select v_prenex_53 .cse2)) v_prenex_53) (= v_DerPreprocessor_38 .cse1) (= v_prenex_51 (let ((.cse3 (@diff v_prenex_54 v_prenex_51))) (store v_prenex_54 .cse3 (select v_prenex_51 .cse3)))) (= (select v_prenex_51 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= .cse2 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select v_prenex_54 .cse1) 1) (= (store (select v_prenex_53 .cse1) 8 |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4) (= (select v_prenex_54 .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 8) 0) (= (select v_prenex_51 v_prenex_52) 0) (= (select v_prenex_54 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= (store .cse5 v_prenex_52 (select |c_#memory_$Pointer$#1.base| v_prenex_52)) |c_#memory_$Pointer$#1.base|) (= |c_#valid| (store v_prenex_51 v_prenex_52 1)))))))) (and (or (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse7) (+ v_prenex_46 8)) .cse8)) .cse9) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_45 (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_52| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_52| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (let ((.cse10 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse10 (select |v_old(#valid)_AFTER_CALL_52| .cse10))) |v_old(#valid)_AFTER_CALL_52|) (= (select v_prenex_45 .cse7) 1))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse11 8)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 8) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse7) (= (select |c_#valid| .cse7) 1) .cse9))))))) is different from false [2024-11-28 05:23:21,696 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (let ((.cse8 (select .cse6 4))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse8))) (let ((.cse7 (select .cse11 4))) (let ((.cse9 (= .cse7 .cse8))) (and (or (exists ((v_prenex_54 (Array Int Int)) (v_prenex_56 Int) (v_DerPreprocessor_38 Int) (v_prenex_55 (Array Int (Array Int Int))) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 (Array Int (Array Int Int)))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_38))) (let ((.cse5 (store (store v_prenex_53 |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6) v_DerPreprocessor_38 .cse4))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse2 (@diff v_prenex_55 v_prenex_53)) (.cse0 (select (select v_prenex_55 .cse1) 4))) (and (= (select (select v_prenex_55 .cse0) (+ v_prenex_56 8)) .cse1) (= (store v_prenex_55 .cse2 (select v_prenex_53 .cse2)) v_prenex_53) (= v_DerPreprocessor_38 .cse1) (= v_prenex_51 (let ((.cse3 (@diff v_prenex_54 v_prenex_51))) (store v_prenex_54 .cse3 (select v_prenex_51 .cse3)))) (= (select v_prenex_51 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= .cse2 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select v_prenex_54 .cse1) 1) (= (store (select v_prenex_53 .cse1) 8 |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4) (= (select v_prenex_54 .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 8) 0) (= (select v_prenex_51 v_prenex_52) 0) (= (select v_prenex_54 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= (store .cse5 v_prenex_52 (select |c_#memory_$Pointer$#1.base| v_prenex_52)) |c_#memory_$Pointer$#1.base|) (= |c_#valid| (store v_prenex_51 v_prenex_52 1)))))))) (and (or (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse7) (+ v_prenex_46 8)) .cse8)) .cse9) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_45 (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_52| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_52| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (let ((.cse10 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse10 (select |v_old(#valid)_AFTER_CALL_52| .cse10))) |v_old(#valid)_AFTER_CALL_52|) (= (select v_prenex_45 .cse7) 1))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse11 8)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 8) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse7) (= (select |c_#valid| .cse7) 1) .cse9))))))) is different from true [2024-11-28 05:23:21,716 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (let ((.cse8 (select .cse6 4))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse8))) (let ((.cse7 (select .cse11 4))) (let ((.cse9 (= .cse7 .cse8))) (and (or (exists ((v_prenex_54 (Array Int Int)) (v_prenex_56 Int) (v_DerPreprocessor_38 Int) (v_prenex_55 (Array Int (Array Int Int))) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 (Array Int (Array Int Int)))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_38))) (let ((.cse5 (store (store v_prenex_53 |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6) v_DerPreprocessor_38 .cse4))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse2 (@diff v_prenex_55 v_prenex_53)) (.cse0 (select (select v_prenex_55 .cse1) 4))) (and (= (select (select v_prenex_55 .cse0) (+ v_prenex_56 8)) .cse1) (= (store v_prenex_55 .cse2 (select v_prenex_53 .cse2)) v_prenex_53) (= v_DerPreprocessor_38 .cse1) (= v_prenex_51 (let ((.cse3 (@diff v_prenex_54 v_prenex_51))) (store v_prenex_54 .cse3 (select v_prenex_51 .cse3)))) (= (select v_prenex_51 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= .cse2 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select v_prenex_54 .cse1) 1) (= (store (select v_prenex_53 .cse1) 8 |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4) (= (select v_prenex_54 .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 8) 0) (= (select v_prenex_51 v_prenex_52) 0) (= (select v_prenex_54 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= (store .cse5 v_prenex_52 (select |c_#memory_$Pointer$#1.base| v_prenex_52)) |c_#memory_$Pointer$#1.base|) (= |c_#valid| (store v_prenex_51 v_prenex_52 1)))))))) (and (or (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse7) (+ v_prenex_46 8)) .cse8)) .cse9) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_45 (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_52| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_52| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (let ((.cse10 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse10 (select |v_old(#valid)_AFTER_CALL_52| .cse10))) |v_old(#valid)_AFTER_CALL_52|) (= (select v_prenex_45 .cse7) 1))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse11 8)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 8) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 0) (or (= (select |c_#valid| .cse7) 1) .cse9))))))) is different from false [2024-11-28 05:23:21,724 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (let ((.cse8 (select .cse6 4))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse8))) (let ((.cse7 (select .cse11 4))) (let ((.cse9 (= .cse7 .cse8))) (and (or (exists ((v_prenex_54 (Array Int Int)) (v_prenex_56 Int) (v_DerPreprocessor_38 Int) (v_prenex_55 (Array Int (Array Int Int))) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 (Array Int (Array Int Int)))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_38))) (let ((.cse5 (store (store v_prenex_53 |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6) v_DerPreprocessor_38 .cse4))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse2 (@diff v_prenex_55 v_prenex_53)) (.cse0 (select (select v_prenex_55 .cse1) 4))) (and (= (select (select v_prenex_55 .cse0) (+ v_prenex_56 8)) .cse1) (= (store v_prenex_55 .cse2 (select v_prenex_53 .cse2)) v_prenex_53) (= v_DerPreprocessor_38 .cse1) (= v_prenex_51 (let ((.cse3 (@diff v_prenex_54 v_prenex_51))) (store v_prenex_54 .cse3 (select v_prenex_51 .cse3)))) (= (select v_prenex_51 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= .cse2 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select v_prenex_54 .cse1) 1) (= (store (select v_prenex_53 .cse1) 8 |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4) (= (select v_prenex_54 .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 8) 0) (= (select v_prenex_51 v_prenex_52) 0) (= (select v_prenex_54 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= (store .cse5 v_prenex_52 (select |c_#memory_$Pointer$#1.base| v_prenex_52)) |c_#memory_$Pointer$#1.base|) (= |c_#valid| (store v_prenex_51 v_prenex_52 1)))))))) (and (or (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse7) (+ v_prenex_46 8)) .cse8)) .cse9) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_45 (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_52| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_52| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (let ((.cse10 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse10 (select |v_old(#valid)_AFTER_CALL_52| .cse10))) |v_old(#valid)_AFTER_CALL_52|) (= (select v_prenex_45 .cse7) 1))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse11 8)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 8) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 0) (or (= (select |c_#valid| .cse7) 1) .cse9))))))) is different from true [2024-11-28 05:23:21,742 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (let ((.cse8 (select .cse6 4))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse8))) (let ((.cse7 (select .cse11 4))) (let ((.cse9 (= .cse7 .cse8))) (and (or (exists ((v_prenex_54 (Array Int Int)) (v_prenex_56 Int) (v_DerPreprocessor_38 Int) (v_prenex_55 (Array Int (Array Int Int))) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 (Array Int (Array Int Int)))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_38))) (let ((.cse5 (store (store v_prenex_53 |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6) v_DerPreprocessor_38 .cse4))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse2 (@diff v_prenex_55 v_prenex_53)) (.cse0 (select (select v_prenex_55 .cse1) 4))) (and (= (select (select v_prenex_55 .cse0) (+ v_prenex_56 8)) .cse1) (= (store v_prenex_55 .cse2 (select v_prenex_53 .cse2)) v_prenex_53) (= v_DerPreprocessor_38 .cse1) (= v_prenex_51 (let ((.cse3 (@diff v_prenex_54 v_prenex_51))) (store v_prenex_54 .cse3 (select v_prenex_51 .cse3)))) (= (select v_prenex_51 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= .cse2 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select v_prenex_54 .cse1) 1) (= (store (select v_prenex_53 .cse1) 8 |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4) (= (select v_prenex_54 .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 8) 0) (= (select v_prenex_51 v_prenex_52) 0) (= (select v_prenex_54 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= (store .cse5 v_prenex_52 (select |c_#memory_$Pointer$#1.base| v_prenex_52)) |c_#memory_$Pointer$#1.base|) (= |c_#valid| (store v_prenex_51 v_prenex_52 1)))))))) (and (or (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse7) (+ v_prenex_46 8)) .cse8)) .cse9) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_45 (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_52| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_52| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (let ((.cse10 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse10 (select |v_old(#valid)_AFTER_CALL_52| .cse10))) |v_old(#valid)_AFTER_CALL_52|) (= (select v_prenex_45 .cse7) 1))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse11 8)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 8) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= (select |c_#valid| .cse7) 1) .cse9))))))) is different from false [2024-11-28 05:23:21,749 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (let ((.cse8 (select .cse6 4))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse8))) (let ((.cse7 (select .cse11 4))) (let ((.cse9 (= .cse7 .cse8))) (and (or (exists ((v_prenex_54 (Array Int Int)) (v_prenex_56 Int) (v_DerPreprocessor_38 Int) (v_prenex_55 (Array Int (Array Int Int))) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 (Array Int (Array Int Int)))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_38))) (let ((.cse5 (store (store v_prenex_53 |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6) v_DerPreprocessor_38 .cse4))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse2 (@diff v_prenex_55 v_prenex_53)) (.cse0 (select (select v_prenex_55 .cse1) 4))) (and (= (select (select v_prenex_55 .cse0) (+ v_prenex_56 8)) .cse1) (= (store v_prenex_55 .cse2 (select v_prenex_53 .cse2)) v_prenex_53) (= v_DerPreprocessor_38 .cse1) (= v_prenex_51 (let ((.cse3 (@diff v_prenex_54 v_prenex_51))) (store v_prenex_54 .cse3 (select v_prenex_51 .cse3)))) (= (select v_prenex_51 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= .cse2 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= (select v_prenex_54 .cse1) 1) (= (store (select v_prenex_53 .cse1) 8 |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4) (= (select v_prenex_54 .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 8) 0) (= (select v_prenex_51 v_prenex_52) 0) (= (select v_prenex_54 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= (store .cse5 v_prenex_52 (select |c_#memory_$Pointer$#1.base| v_prenex_52)) |c_#memory_$Pointer$#1.base|) (= |c_#valid| (store v_prenex_51 v_prenex_52 1)))))))) (and (or (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse7) (+ v_prenex_46 8)) .cse8)) .cse9) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_prenex_45 (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_52| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_52| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (let ((.cse10 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse10 (select |v_old(#valid)_AFTER_CALL_52| .cse10))) |v_old(#valid)_AFTER_CALL_52|) (= (select v_prenex_45 .cse7) 1))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse11 8)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 8) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= (select |c_#valid| .cse7) 1) .cse9))))))) is different from true [2024-11-28 05:23:21,835 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 4))) (or (= .cse0 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= (select |c_#valid| .cse0) 1))) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.offset| 0) (or (exists ((v_prenex_54 (Array Int Int)) (v_prenex_56 Int) (v_prenex_55 (Array Int (Array Int Int))) (v_DerPreprocessor_38 Int) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 (Array Int (Array Int Int)))) (let ((.cse1 (@diff v_prenex_55 v_prenex_53))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse7 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_38))) (let ((.cse6 (store (store v_prenex_53 .cse1 .cse5) v_DerPreprocessor_38 .cse7))) (let ((.cse2 (select (select .cse6 .cse1) 4))) (let ((.cse4 (select (select v_prenex_55 .cse2) 4))) (and (= (store v_prenex_55 .cse1 (select v_prenex_53 .cse1)) v_prenex_53) (= .cse2 v_DerPreprocessor_38) (= 1 (select v_prenex_51 .cse1)) (= v_prenex_51 (let ((.cse3 (@diff v_prenex_54 v_prenex_51))) (store v_prenex_54 .cse3 (select v_prenex_51 .cse3)))) (= (select v_prenex_54 .cse2) 1) (= (select v_prenex_54 .cse4) 1) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| (select .cse5 4)) (= (store .cse6 v_prenex_52 (select |c_#memory_$Pointer$#1.base| v_prenex_52)) |c_#memory_$Pointer$#1.base|) (= (select (select v_prenex_55 .cse4) (+ v_prenex_56 8)) .cse2) (= (select v_prenex_51 v_prenex_52) 0) (= (store (select v_prenex_53 .cse2) 8 .cse1) .cse7) (= 0 (select v_prenex_54 .cse1)) (= |c_#valid| (store v_prenex_51 v_prenex_52 1))))))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (exists ((v_prenex_45 (Array Int Int))) (and (= (let ((.cse8 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse8 (select |v_old(#valid)_AFTER_CALL_52| .cse8))) |v_old(#valid)_AFTER_CALL_52|) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse10))) (let ((.cse11 (select .cse9 4))) (and (= |v_ULTIMATE.start_dll_append_~last~0#1.base_50| (select .cse9 8)) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| .cse10) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= .cse11 .cse10) (= 1 (select v_prenex_45 .cse11)) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0)))))))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (exists ((v_prenex_45 (Array Int Int))) (and (= (let ((.cse12 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse12 (select |v_old(#valid)_AFTER_CALL_52| .cse12))) |v_old(#valid)_AFTER_CALL_52|) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse15))) (let ((.cse14 (select .cse13 4))) (and (= |v_ULTIMATE.start_dll_append_~last~0#1.base_50| (select .cse13 8)) (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse14) (+ v_prenex_46 8)) .cse15)) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| .cse15) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select |v_old(#valid)_AFTER_CALL_52| .cse15) 1) (= 1 (select v_prenex_45 .cse14)) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0)))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0))))) is different from false [2024-11-28 05:23:21,843 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 4))) (or (= .cse0 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= (select |c_#valid| .cse0) 1))) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.offset| 0) (or (exists ((v_prenex_54 (Array Int Int)) (v_prenex_56 Int) (v_prenex_55 (Array Int (Array Int Int))) (v_DerPreprocessor_38 Int) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 (Array Int (Array Int Int)))) (let ((.cse1 (@diff v_prenex_55 v_prenex_53))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse7 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_38))) (let ((.cse6 (store (store v_prenex_53 .cse1 .cse5) v_DerPreprocessor_38 .cse7))) (let ((.cse2 (select (select .cse6 .cse1) 4))) (let ((.cse4 (select (select v_prenex_55 .cse2) 4))) (and (= (store v_prenex_55 .cse1 (select v_prenex_53 .cse1)) v_prenex_53) (= .cse2 v_DerPreprocessor_38) (= 1 (select v_prenex_51 .cse1)) (= v_prenex_51 (let ((.cse3 (@diff v_prenex_54 v_prenex_51))) (store v_prenex_54 .cse3 (select v_prenex_51 .cse3)))) (= (select v_prenex_54 .cse2) 1) (= (select v_prenex_54 .cse4) 1) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| (select .cse5 4)) (= (store .cse6 v_prenex_52 (select |c_#memory_$Pointer$#1.base| v_prenex_52)) |c_#memory_$Pointer$#1.base|) (= (select (select v_prenex_55 .cse4) (+ v_prenex_56 8)) .cse2) (= (select v_prenex_51 v_prenex_52) 0) (= (store (select v_prenex_53 .cse2) 8 .cse1) .cse7) (= 0 (select v_prenex_54 .cse1)) (= |c_#valid| (store v_prenex_51 v_prenex_52 1))))))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (exists ((v_prenex_45 (Array Int Int))) (and (= (let ((.cse8 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse8 (select |v_old(#valid)_AFTER_CALL_52| .cse8))) |v_old(#valid)_AFTER_CALL_52|) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse10))) (let ((.cse11 (select .cse9 4))) (and (= |v_ULTIMATE.start_dll_append_~last~0#1.base_50| (select .cse9 8)) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| .cse10) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= .cse11 .cse10) (= 1 (select v_prenex_45 .cse11)) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0)))))))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (exists ((v_prenex_45 (Array Int Int))) (and (= (let ((.cse12 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse12 (select |v_old(#valid)_AFTER_CALL_52| .cse12))) |v_old(#valid)_AFTER_CALL_52|) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse15))) (let ((.cse14 (select .cse13 4))) (and (= |v_ULTIMATE.start_dll_append_~last~0#1.base_50| (select .cse13 8)) (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse14) (+ v_prenex_46 8)) .cse15)) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| .cse15) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select |v_old(#valid)_AFTER_CALL_52| .cse15) 1) (= 1 (select v_prenex_45 .cse14)) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0)))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0))))) is different from true [2024-11-28 05:23:21,902 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (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 (exists ((v_prenex_54 (Array Int Int)) (v_prenex_56 Int) (v_prenex_55 (Array Int (Array Int Int))) (v_DerPreprocessor_38 Int) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 (Array Int (Array Int Int)))) (let ((.cse1 (@diff v_prenex_55 v_prenex_53))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse7 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_38))) (let ((.cse5 (store (store v_prenex_53 .cse1 .cse6) v_DerPreprocessor_38 .cse7))) (let ((.cse2 (select (select .cse5 .cse1) 4))) (let ((.cse4 (select (select v_prenex_55 .cse2) 4))) (and (= (store v_prenex_55 .cse1 (select v_prenex_53 .cse1)) v_prenex_53) (= .cse2 v_DerPreprocessor_38) (= 1 (select v_prenex_51 .cse1)) (= v_prenex_51 (let ((.cse3 (@diff v_prenex_54 v_prenex_51))) (store v_prenex_54 .cse3 (select v_prenex_51 .cse3)))) (= (select v_prenex_54 .cse2) 1) (= (select v_prenex_54 .cse4) 1) (= (store .cse5 v_prenex_52 (select |c_#memory_$Pointer$#1.base| v_prenex_52)) |c_#memory_$Pointer$#1.base|) (= (select (select v_prenex_55 .cse4) (+ v_prenex_56 8)) .cse2) (= (select v_prenex_51 v_prenex_52) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse6 4)) (= (store (select v_prenex_53 .cse2) 8 .cse1) .cse7) (= 0 (select v_prenex_54 .cse1)) (= |c_#valid| (store v_prenex_51 v_prenex_52 1))))))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (exists ((v_prenex_45 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse10))) (let ((.cse9 (select .cse8 4))) (and (= |v_ULTIMATE.start_dll_append_~last~0#1.base_50| (select .cse8 8)) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= .cse9 .cse10) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse10) (= 1 (select v_prenex_45 .cse9)) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0)))))) (= (let ((.cse11 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse11 (select |v_old(#valid)_AFTER_CALL_52| .cse11))) |v_old(#valid)_AFTER_CALL_52|))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (exists ((v_prenex_45 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse14 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse14))) (let ((.cse13 (select .cse12 4))) (and (= |v_ULTIMATE.start_dll_append_~last~0#1.base_50| (select .cse12 8)) (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse13) (+ v_prenex_46 8)) .cse14)) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select |v_old(#valid)_AFTER_CALL_52| .cse14) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse14) (= 1 (select v_prenex_45 .cse13)) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0)))))) (= (let ((.cse15 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse15 (select |v_old(#valid)_AFTER_CALL_52| .cse15))) |v_old(#valid)_AFTER_CALL_52|))))))) is different from false [2024-11-28 05:23:21,938 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (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 (exists ((v_prenex_54 (Array Int Int)) (v_prenex_56 Int) (v_prenex_55 (Array Int (Array Int Int))) (v_DerPreprocessor_38 Int) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 (Array Int (Array Int Int)))) (let ((.cse1 (@diff v_prenex_55 v_prenex_53))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse7 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_38))) (let ((.cse5 (store (store v_prenex_53 .cse1 .cse6) v_DerPreprocessor_38 .cse7))) (let ((.cse2 (select (select .cse5 .cse1) 4))) (let ((.cse4 (select (select v_prenex_55 .cse2) 4))) (and (= (store v_prenex_55 .cse1 (select v_prenex_53 .cse1)) v_prenex_53) (= .cse2 v_DerPreprocessor_38) (= 1 (select v_prenex_51 .cse1)) (= v_prenex_51 (let ((.cse3 (@diff v_prenex_54 v_prenex_51))) (store v_prenex_54 .cse3 (select v_prenex_51 .cse3)))) (= (select v_prenex_54 .cse2) 1) (= (select v_prenex_54 .cse4) 1) (= (store .cse5 v_prenex_52 (select |c_#memory_$Pointer$#1.base| v_prenex_52)) |c_#memory_$Pointer$#1.base|) (= (select (select v_prenex_55 .cse4) (+ v_prenex_56 8)) .cse2) (= (select v_prenex_51 v_prenex_52) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse6 4)) (= (store (select v_prenex_53 .cse2) 8 .cse1) .cse7) (= 0 (select v_prenex_54 .cse1)) (= |c_#valid| (store v_prenex_51 v_prenex_52 1))))))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (exists ((v_prenex_45 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse10))) (let ((.cse9 (select .cse8 4))) (and (= |v_ULTIMATE.start_dll_append_~last~0#1.base_50| (select .cse8 8)) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= .cse9 .cse10) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse10) (= 1 (select v_prenex_45 .cse9)) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0)))))) (= (let ((.cse11 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse11 (select |v_old(#valid)_AFTER_CALL_52| .cse11))) |v_old(#valid)_AFTER_CALL_52|))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (exists ((v_prenex_45 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse14 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse14))) (let ((.cse13 (select .cse12 4))) (and (= |v_ULTIMATE.start_dll_append_~last~0#1.base_50| (select .cse12 8)) (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse13) (+ v_prenex_46 8)) .cse14)) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select |v_old(#valid)_AFTER_CALL_52| .cse14) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse14) (= 1 (select v_prenex_45 .cse13)) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0)))))) (= (let ((.cse15 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse15 (select |v_old(#valid)_AFTER_CALL_52| .cse15))) |v_old(#valid)_AFTER_CALL_52|))))))) is different from true [2024-11-28 05:23:22,023 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (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 (exists ((v_prenex_54 (Array Int Int)) (v_prenex_56 Int) (v_prenex_55 (Array Int (Array Int Int))) (v_DerPreprocessor_38 Int) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 (Array Int (Array Int Int)))) (let ((.cse1 (@diff v_prenex_55 v_prenex_53))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse7 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_38))) (let ((.cse5 (store (store v_prenex_53 .cse1 .cse6) v_DerPreprocessor_38 .cse7))) (let ((.cse2 (select (select .cse5 .cse1) 4))) (let ((.cse4 (select (select v_prenex_55 .cse2) 4))) (and (= (store v_prenex_55 .cse1 (select v_prenex_53 .cse1)) v_prenex_53) (= .cse2 v_DerPreprocessor_38) (= 1 (select v_prenex_51 .cse1)) (= v_prenex_51 (let ((.cse3 (@diff v_prenex_54 v_prenex_51))) (store v_prenex_54 .cse3 (select v_prenex_51 .cse3)))) (= (select v_prenex_54 .cse2) 1) (= (select v_prenex_54 .cse4) 1) (= (store .cse5 v_prenex_52 (select |c_#memory_$Pointer$#1.base| v_prenex_52)) |c_#memory_$Pointer$#1.base|) (= (select (select v_prenex_55 .cse4) (+ v_prenex_56 8)) .cse2) (= (select v_prenex_51 v_prenex_52) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse6 4)) (= (store (select v_prenex_53 .cse2) 8 .cse1) .cse7) (= 0 (select v_prenex_54 .cse1)) (= |c_#valid| (store v_prenex_51 v_prenex_52 1))))))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (exists ((v_prenex_45 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse10))) (let ((.cse9 (select .cse8 4))) (and (= |v_ULTIMATE.start_dll_append_~last~0#1.base_50| (select .cse8 8)) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= .cse9 .cse10) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse10) (= 1 (select v_prenex_45 .cse9)) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0)))))) (= (let ((.cse11 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse11 (select |v_old(#valid)_AFTER_CALL_52| .cse11))) |v_old(#valid)_AFTER_CALL_52|))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (exists ((v_prenex_45 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse14 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse14))) (let ((.cse13 (select .cse12 4))) (and (= |v_ULTIMATE.start_dll_append_~last~0#1.base_50| (select .cse12 8)) (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse13) (+ v_prenex_46 8)) .cse14)) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select |v_old(#valid)_AFTER_CALL_52| .cse14) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse14) (= 1 (select v_prenex_45 .cse13)) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0)))))) (= (let ((.cse15 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse15 (select |v_old(#valid)_AFTER_CALL_52| .cse15))) |v_old(#valid)_AFTER_CALL_52|))))))) is different from false [2024-11-28 05:23:22,031 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (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 (exists ((v_prenex_54 (Array Int Int)) (v_prenex_56 Int) (v_prenex_55 (Array Int (Array Int Int))) (v_DerPreprocessor_38 Int) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 (Array Int (Array Int Int)))) (let ((.cse1 (@diff v_prenex_55 v_prenex_53))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse7 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_38))) (let ((.cse5 (store (store v_prenex_53 .cse1 .cse6) v_DerPreprocessor_38 .cse7))) (let ((.cse2 (select (select .cse5 .cse1) 4))) (let ((.cse4 (select (select v_prenex_55 .cse2) 4))) (and (= (store v_prenex_55 .cse1 (select v_prenex_53 .cse1)) v_prenex_53) (= .cse2 v_DerPreprocessor_38) (= 1 (select v_prenex_51 .cse1)) (= v_prenex_51 (let ((.cse3 (@diff v_prenex_54 v_prenex_51))) (store v_prenex_54 .cse3 (select v_prenex_51 .cse3)))) (= (select v_prenex_54 .cse2) 1) (= (select v_prenex_54 .cse4) 1) (= (store .cse5 v_prenex_52 (select |c_#memory_$Pointer$#1.base| v_prenex_52)) |c_#memory_$Pointer$#1.base|) (= (select (select v_prenex_55 .cse4) (+ v_prenex_56 8)) .cse2) (= (select v_prenex_51 v_prenex_52) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse6 4)) (= (store (select v_prenex_53 .cse2) 8 .cse1) .cse7) (= 0 (select v_prenex_54 .cse1)) (= |c_#valid| (store v_prenex_51 v_prenex_52 1))))))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (exists ((v_prenex_45 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse10))) (let ((.cse9 (select .cse8 4))) (and (= |v_ULTIMATE.start_dll_append_~last~0#1.base_50| (select .cse8 8)) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= .cse9 .cse10) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse10) (= 1 (select v_prenex_45 .cse9)) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0)))))) (= (let ((.cse11 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse11 (select |v_old(#valid)_AFTER_CALL_52| .cse11))) |v_old(#valid)_AFTER_CALL_52|))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (exists ((v_prenex_45 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_50| Int)) (let ((.cse14 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 4))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse14))) (let ((.cse13 (select .cse12 4))) (and (= |v_ULTIMATE.start_dll_append_~last~0#1.base_50| (select .cse12 8)) (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse13) (+ v_prenex_46 8)) .cse14)) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 1) (= (select |v_old(#valid)_AFTER_CALL_52| .cse14) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse14) (= 1 (select v_prenex_45 .cse13)) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_50|) 0)))))) (= (let ((.cse15 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse15 (select |v_old(#valid)_AFTER_CALL_52| .cse15))) |v_old(#valid)_AFTER_CALL_52|))))))) is different from true [2024-11-28 05:23:22,077 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_arrayElimCell_212 Int) (v_arrayElimCell_214 Int) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1) (not (= v_arrayElimCell_214 v_arrayElimCell_212)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (select v_prenex_45 v_arrayElimCell_214) 0) (= (let ((.cse0 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0))) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_52| v_arrayElimCell_214) 1) (= (select |v_old(#valid)_AFTER_CALL_52| v_arrayElimCell_212) 1))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (let ((.cse1 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1))) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_52| v_arrayElimCell_210) 1) (= 0 (select v_prenex_45 v_arrayElimCell_210)))) (exists ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_prenex_54 (Array Int Int)) (v_prenex_56 Int) (v_prenex_55 (Array Int (Array Int Int))) (v_DerPreprocessor_38 Int) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 (Array Int (Array Int Int)))) (let ((.cse2 (@diff v_prenex_55 v_prenex_53))) (let ((.cse7 (store (store (store v_prenex_53 .cse2 v_DerPreprocessor_41) v_DerPreprocessor_38 v_DerPreprocessor_42) v_prenex_52 v_DerPreprocessor_43))) (let ((.cse8 (select .cse7 .cse2)) (.cse5 (select .cse7 v_DerPreprocessor_38))) (let ((.cse3 (select (select (store (store v_prenex_53 .cse2 .cse8) v_DerPreprocessor_38 .cse5) .cse2) 4))) (let ((.cse6 (select (select v_prenex_55 .cse3) 4))) (and (= (store v_prenex_55 .cse2 (select v_prenex_53 .cse2)) v_prenex_53) (= (select v_prenex_54 .cse3) 1) (= 1 (select v_prenex_51 .cse2)) (= v_prenex_51 (let ((.cse4 (@diff v_prenex_54 v_prenex_51))) (store v_prenex_54 .cse4 (select v_prenex_51 .cse4)))) (= (store (select v_prenex_53 .cse3) 8 .cse2) .cse5) (= v_DerPreprocessor_38 .cse3) (= (select (select v_prenex_55 .cse6) (+ v_prenex_56 8)) .cse3) (= (select v_prenex_51 v_prenex_52) 0) (= (select (select .cse7 (select .cse8 4)) 4) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= 0 (select v_prenex_54 .cse2)) (= |c_#valid| (store v_prenex_51 v_prenex_52 1)) (= (select v_prenex_54 .cse6) 1))))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1)) is different from false [2024-11-28 05:23:22,084 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_arrayElimCell_212 Int) (v_arrayElimCell_214 Int) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1) (not (= v_arrayElimCell_214 v_arrayElimCell_212)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (select v_prenex_45 v_arrayElimCell_214) 0) (= (let ((.cse0 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0))) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_52| v_arrayElimCell_214) 1) (= (select |v_old(#valid)_AFTER_CALL_52| v_arrayElimCell_212) 1))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (let ((.cse1 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1))) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_52| v_arrayElimCell_210) 1) (= 0 (select v_prenex_45 v_arrayElimCell_210)))) (exists ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_prenex_54 (Array Int Int)) (v_prenex_56 Int) (v_prenex_55 (Array Int (Array Int Int))) (v_DerPreprocessor_38 Int) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 (Array Int (Array Int Int)))) (let ((.cse2 (@diff v_prenex_55 v_prenex_53))) (let ((.cse7 (store (store (store v_prenex_53 .cse2 v_DerPreprocessor_41) v_DerPreprocessor_38 v_DerPreprocessor_42) v_prenex_52 v_DerPreprocessor_43))) (let ((.cse8 (select .cse7 .cse2)) (.cse5 (select .cse7 v_DerPreprocessor_38))) (let ((.cse3 (select (select (store (store v_prenex_53 .cse2 .cse8) v_DerPreprocessor_38 .cse5) .cse2) 4))) (let ((.cse6 (select (select v_prenex_55 .cse3) 4))) (and (= (store v_prenex_55 .cse2 (select v_prenex_53 .cse2)) v_prenex_53) (= (select v_prenex_54 .cse3) 1) (= 1 (select v_prenex_51 .cse2)) (= v_prenex_51 (let ((.cse4 (@diff v_prenex_54 v_prenex_51))) (store v_prenex_54 .cse4 (select v_prenex_51 .cse4)))) (= (store (select v_prenex_53 .cse3) 8 .cse2) .cse5) (= v_DerPreprocessor_38 .cse3) (= (select (select v_prenex_55 .cse6) (+ v_prenex_56 8)) .cse3) (= (select v_prenex_51 v_prenex_52) 0) (= (select (select .cse7 (select .cse8 4)) 4) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= 0 (select v_prenex_54 .cse2)) (= |c_#valid| (store v_prenex_51 v_prenex_52 1)) (= (select v_prenex_54 .cse6) 1))))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1)) is different from true [2024-11-28 05:23:22,134 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (let ((.cse0 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0))) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_52| v_arrayElimCell_210) 1) (= 0 (select v_prenex_45 v_arrayElimCell_210)))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_arrayElimCell_212 Int) (v_arrayElimCell_214 Int) (v_prenex_45 (Array Int Int))) (and (not (= v_arrayElimCell_214 v_arrayElimCell_212)) (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (select v_prenex_45 v_arrayElimCell_214) 0) (= (let ((.cse1 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1))) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_52| v_arrayElimCell_214) 1) (= (select |v_old(#valid)_AFTER_CALL_52| v_arrayElimCell_212) 1))) (exists ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_prenex_54 (Array Int Int)) (v_prenex_56 Int) (v_prenex_55 (Array Int (Array Int Int))) (v_DerPreprocessor_38 Int) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 (Array Int (Array Int Int)))) (let ((.cse2 (@diff v_prenex_55 v_prenex_53))) (let ((.cse6 (store (store (store v_prenex_53 .cse2 v_DerPreprocessor_41) v_DerPreprocessor_38 v_DerPreprocessor_42) v_prenex_52 v_DerPreprocessor_43))) (let ((.cse7 (select .cse6 .cse2)) (.cse5 (select .cse6 v_DerPreprocessor_38))) (let ((.cse3 (select (select (store (store v_prenex_53 .cse2 .cse7) v_DerPreprocessor_38 .cse5) .cse2) 4))) (let ((.cse8 (select (select v_prenex_55 .cse3) 4))) (and (= (store v_prenex_55 .cse2 (select v_prenex_53 .cse2)) v_prenex_53) (= (select v_prenex_54 .cse3) 1) (= 1 (select v_prenex_51 .cse2)) (= v_prenex_51 (let ((.cse4 (@diff v_prenex_54 v_prenex_51))) (store v_prenex_54 .cse4 (select v_prenex_51 .cse4)))) (= (store (select v_prenex_53 .cse3) 8 .cse2) .cse5) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select .cse6 (select .cse7 4)) 4)) (= v_DerPreprocessor_38 .cse3) (= (select (select v_prenex_55 .cse8) (+ v_prenex_56 8)) .cse3) (= (select v_prenex_51 v_prenex_52) 0) (= 0 (select v_prenex_54 .cse2)) (= |c_#valid| (store v_prenex_51 v_prenex_52 1)) (= (select v_prenex_54 .cse8) 1)))))))))) is different from false [2024-11-28 05:23:22,141 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (let ((.cse0 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0))) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_52| v_arrayElimCell_210) 1) (= 0 (select v_prenex_45 v_arrayElimCell_210)))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_arrayElimCell_212 Int) (v_arrayElimCell_214 Int) (v_prenex_45 (Array Int Int))) (and (not (= v_arrayElimCell_214 v_arrayElimCell_212)) (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_52| |node_create_~temp~0#1.base|) 0) (= (select v_prenex_45 v_arrayElimCell_214) 0) (= (let ((.cse1 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_52|))) (store v_prenex_45 .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1))) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_52| v_arrayElimCell_214) 1) (= (select |v_old(#valid)_AFTER_CALL_52| v_arrayElimCell_212) 1))) (exists ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_prenex_54 (Array Int Int)) (v_prenex_56 Int) (v_prenex_55 (Array Int (Array Int Int))) (v_DerPreprocessor_38 Int) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 (Array Int (Array Int Int)))) (let ((.cse2 (@diff v_prenex_55 v_prenex_53))) (let ((.cse6 (store (store (store v_prenex_53 .cse2 v_DerPreprocessor_41) v_DerPreprocessor_38 v_DerPreprocessor_42) v_prenex_52 v_DerPreprocessor_43))) (let ((.cse7 (select .cse6 .cse2)) (.cse5 (select .cse6 v_DerPreprocessor_38))) (let ((.cse3 (select (select (store (store v_prenex_53 .cse2 .cse7) v_DerPreprocessor_38 .cse5) .cse2) 4))) (let ((.cse8 (select (select v_prenex_55 .cse3) 4))) (and (= (store v_prenex_55 .cse2 (select v_prenex_53 .cse2)) v_prenex_53) (= (select v_prenex_54 .cse3) 1) (= 1 (select v_prenex_51 .cse2)) (= v_prenex_51 (let ((.cse4 (@diff v_prenex_54 v_prenex_51))) (store v_prenex_54 .cse4 (select v_prenex_51 .cse4)))) (= (store (select v_prenex_53 .cse3) 8 .cse2) .cse5) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select .cse6 (select .cse7 4)) 4)) (= v_DerPreprocessor_38 .cse3) (= (select (select v_prenex_55 .cse8) (+ v_prenex_56 8)) .cse3) (= (select v_prenex_51 v_prenex_52) 0) (= 0 (select v_prenex_54 .cse2)) (= |c_#valid| (store v_prenex_51 v_prenex_52 1)) (= (select v_prenex_54 .cse8) 1)))))))))) is different from true [2024-11-28 05:23:22,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:23:22,224 INFO L93 Difference]: Finished difference Result 156 states and 169 transitions. [2024-11-28 05:23:22,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-28 05:23:22,225 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 55 states have (on average 1.8909090909090909) internal successors, (104), 52 states have internal predecessors, (104), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 75 [2024-11-28 05:23:22,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:23:22,226 INFO L225 Difference]: With dead ends: 156 [2024-11-28 05:23:22,226 INFO L226 Difference]: Without dead ends: 156 [2024-11-28 05:23:22,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 43 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=233, Invalid=2109, Unknown=86, NotChecked=5762, Total=8190 [2024-11-28 05:23:22,227 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 8 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 4776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3659 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:23:22,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1209 Invalid, 4776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1107 Invalid, 0 Unknown, 3659 Unchecked, 1.3s Time] [2024-11-28 05:23:22,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-28 05:23:22,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2024-11-28 05:23:22,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 131 states have (on average 1.2061068702290076) internal successors, (158), 146 states have internal predecessors, (158), 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 05:23:22,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 168 transitions. [2024-11-28 05:23:22,233 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 168 transitions. Word has length 75 [2024-11-28 05:23:22,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:23:22,233 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 168 transitions. [2024-11-28 05:23:22,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 55 states have (on average 1.8909090909090909) internal successors, (104), 52 states have internal predecessors, (104), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-28 05:23:22,234 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 168 transitions. [2024-11-28 05:23:22,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 05:23:22,234 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:23:22,234 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 05:23:22,246 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-28 05:23:22,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-28 05:23:22,435 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:23:22,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:23:22,435 INFO L85 PathProgramCache]: Analyzing trace with hash 114963925, now seen corresponding path program 2 times [2024-11-28 05:23:22,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:23:22,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120705655] [2024-11-28 05:23:22,436 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:23:22,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:23:22,476 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:23:22,476 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:23:22,613 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 05:23:22,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:23:22,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120705655] [2024-11-28 05:23:22,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120705655] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:23:22,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194013545] [2024-11-28 05:23:22,613 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:23:22,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:23:22,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:23:22,616 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:23:22,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-28 05:23:23,000 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:23:23,000 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:23:23,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 05:23:23,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:23:23,043 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 05:23:23,043 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:23:23,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194013545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:23:23,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 05:23:23,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-11-28 05:23:23,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589646884] [2024-11-28 05:23:23,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:23:23,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:23:23,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:23:23,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:23:23,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:23:23,044 INFO L87 Difference]: Start difference. First operand 155 states and 168 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 05:23:23,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:23:23,067 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2024-11-28 05:23:23,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:23:23,068 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 05:23:23,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:23:23,069 INFO L225 Difference]: With dead ends: 102 [2024-11-28 05:23:23,069 INFO L226 Difference]: Without dead ends: 102 [2024-11-28 05:23:23,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:23:23,070 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:23:23,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 226 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:23:23,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-28 05:23:23,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-28 05:23:23,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 85 states have (on average 1.2) internal successors, (102), 96 states have internal predecessors, (102), 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:23:23,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2024-11-28 05:23:23,074 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 75 [2024-11-28 05:23:23,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:23:23,075 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2024-11-28 05:23:23,075 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 05:23:23,075 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2024-11-28 05:23:23,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-28 05:23:23,076 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:23:23,076 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:23:23,088 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-28 05:23:23,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-28 05:23:23,276 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:23:23,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:23:23,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1431623842, now seen corresponding path program 1 times [2024-11-28 05:23:23,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:23:23,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881804528] [2024-11-28 05:23:23,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:23:23,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:23:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:23:28,177 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:23:28,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:23:28,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881804528] [2024-11-28 05:23:28,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881804528] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:23:28,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255690729] [2024-11-28 05:23:28,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:23:28,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:23:28,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:23:28,181 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:23:28,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-28 05:23:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:23:28,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 190 conjuncts are in the unsatisfiable core [2024-11-28 05:23:28,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:23:28,759 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 05:23:29,179 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:23:29,295 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:23:29,301 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:23:29,310 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 23 treesize of output 11 [2024-11-28 05:23:29,807 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 05:23:29,808 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 16 treesize of output 15 [2024-11-28 05:23:29,835 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 05:23:29,835 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 16 treesize of output 15 [2024-11-28 05:23:29,859 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 05:23:29,859 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 16 treesize of output 15 [2024-11-28 05:23:29,877 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:23:29,877 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 05:23:30,142 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 16 treesize of output 11 [2024-11-28 05:23:30,152 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 16 treesize of output 11 [2024-11-28 05:23:30,162 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 16 treesize of output 11 [2024-11-28 05:23:30,299 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 21 treesize of output 20 [2024-11-28 05:23:30,322 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 16 treesize of output 11 [2024-11-28 05:23:30,332 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 21 treesize of output 20 [2024-11-28 05:23:30,546 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-11-28 05:23:30,546 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 150 treesize of output 83 [2024-11-28 05:23:30,552 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 46 treesize of output 42 [2024-11-28 05:23:30,574 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 47 treesize of output 17 [2024-11-28 05:23:31,448 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-28 05:23:31,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 173 treesize of output 56 [2024-11-28 05:23:31,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 36 treesize of output 14 [2024-11-28 05:23:31,463 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:23:31,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 treesize of output 3 [2024-11-28 05:23:32,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:23:32,055 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-28 05:23:32,055 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 181 treesize of output 130 [2024-11-28 05:23:32,109 INFO L349 Elim1Store]: treesize reduction 60, result has 47.8 percent of original size [2024-11-28 05:23:32,109 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 72 treesize of output 80 [2024-11-28 05:23:32,123 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 05:23:32,137 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:23:32,182 INFO L349 Elim1Store]: treesize reduction 41, result has 47.4 percent of original size [2024-11-28 05:23:32,182 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 1 case distinctions, treesize of input 30 treesize of output 43 [2024-11-28 05:23:32,223 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-28 05:23:32,223 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 34 treesize of output 36 [2024-11-28 05:23:34,373 INFO L349 Elim1Store]: treesize reduction 203, result has 33.2 percent of original size [2024-11-28 05:23:34,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 218 treesize of output 158 [2024-11-28 05:23:34,478 INFO L349 Elim1Store]: treesize reduction 376, result has 15.5 percent of original size [2024-11-28 05:23:34,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 290 treesize of output 253 [2024-11-28 05:23:34,515 INFO L349 Elim1Store]: treesize reduction 65, result has 44.0 percent of original size [2024-11-28 05:23:34,515 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 53 treesize of output 55 [2024-11-28 05:23:42,359 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2024-11-28 05:23:42,359 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 550 treesize of output 464 [2024-11-28 05:23:49,755 WARN L286 SmtUtils]: Spent 7.36s on a formula simplification. DAG size of input: 772 DAG size of output: 587 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-28 05:23:49,755 INFO L349 Elim1Store]: treesize reduction 768, result has 61.8 percent of original size [2024-11-28 05:23:49,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 18 select indices, 18 select index equivalence classes, 4 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 168 case distinctions, treesize of input 505 treesize of output 1661 [2024-11-28 05:23:50,188 INFO L349 Elim1Store]: treesize reduction 29, result has 3.3 percent of original size [2024-11-28 05:23:50,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 399 treesize of output 372 [2024-11-28 05:23:55,932 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 05:33:10,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-11-28 05:33:10,043 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-28 05:33:10,044 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-28 05:33:10,053 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-28 05:33:10,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:33:10,245 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:590) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.pushInner(QuantifierPusher.java:274) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:194) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 75 more [2024-11-28 05:33:10,252 INFO L158 Benchmark]: Toolchain (without parser) took 738995.73ms. Allocated memory was 117.4MB in the beginning and 939.5MB in the end (delta: 822.1MB). Free memory was 91.5MB in the beginning and 590.9MB in the end (delta: -499.4MB). Peak memory consumption was 591.7MB. Max. memory is 16.1GB. [2024-11-28 05:33:10,252 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 117.4MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:33:10,252 INFO L158 Benchmark]: CACSL2BoogieTranslator took 488.06ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 73.5MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 05:33:10,252 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.32ms. Allocated memory is still 117.4MB. Free memory was 73.5MB in the beginning and 71.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:33:10,253 INFO L158 Benchmark]: Boogie Preprocessor took 53.18ms. Allocated memory is still 117.4MB. Free memory was 71.5MB in the beginning and 68.8MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 05:33:10,253 INFO L158 Benchmark]: RCFGBuilder took 709.95ms. Allocated memory is still 117.4MB. Free memory was 68.8MB in the beginning and 44.4MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 05:33:10,253 INFO L158 Benchmark]: TraceAbstraction took 737670.80ms. Allocated memory was 117.4MB in the beginning and 939.5MB in the end (delta: 822.1MB). Free memory was 43.9MB in the beginning and 590.9MB in the end (delta: -547.0MB). Peak memory consumption was 541.4MB. Max. memory is 16.1GB. [2024-11-28 05:33:10,254 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 117.4MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 488.06ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 73.5MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.32ms. Allocated memory is still 117.4MB. Free memory was 73.5MB in the beginning and 71.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.18ms. Allocated memory is still 117.4MB. Free memory was 71.5MB in the beginning and 68.8MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 709.95ms. Allocated memory is still 117.4MB. Free memory was 68.8MB in the beginning and 44.4MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 737670.80ms. Allocated memory was 117.4MB in the beginning and 939.5MB in the end (delta: 822.1MB). Free memory was 43.9MB in the beginning and 590.9MB in the end (delta: -547.0MB). Peak memory consumption was 541.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/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_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/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 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:33:13,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:33:13,397 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-28 05:33:13,409 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:33:13,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:33:13,463 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:33:13,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:33:13,465 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:33:13,466 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 05:33:13,466 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 05:33:13,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:33:13,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:33:13,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:33:13,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:33:13,469 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:33:13,469 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:33:13,469 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 05:33:13,470 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 05:33:13,470 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 05:33:13,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:33:13,470 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 05:33:13,470 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 05:33:13,472 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 05:33:13,472 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:33:13,472 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 05:33:13,472 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 05:33:13,472 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 05:33:13,473 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 05:33:13,473 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 05:33:13,473 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:33:13,473 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:33:13,473 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:33:13,473 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:33:13,473 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:33:13,473 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:33:13,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:33:13,474 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:33:13,474 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:33:13,474 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:33:13,474 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:33:13,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:33:13,474 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:33:13,474 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:33:13,474 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 05:33:13,474 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 05:33:13,474 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:33:13,475 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:33:13,475 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:33:13,475 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:33:13,475 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_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/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 -> 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 [2024-11-28 05:33:13,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:33:13,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:33:13,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:33:13,922 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:33:13,922 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:33:13,924 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2024-11-28 05:33:17,461 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/data/eaf359ce7/786dcd109077409fa83d4a09d2b634de/FLAG8e32f2a77 [2024-11-28 05:33:17,856 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:33:17,857 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2024-11-28 05:33:17,886 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/data/eaf359ce7/786dcd109077409fa83d4a09d2b634de/FLAG8e32f2a77 [2024-11-28 05:33:17,914 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/data/eaf359ce7/786dcd109077409fa83d4a09d2b634de [2024-11-28 05:33:17,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:33:17,922 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:33:17,924 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:33:17,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:33:17,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:33:17,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:33:17" (1/1) ... [2024-11-28 05:33:17,934 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28ebbe2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:33:17, skipping insertion in model container [2024-11-28 05:33:17,934 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:33:17" (1/1) ... [2024-11-28 05:33:17,972 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:33:18,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:33:18,475 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 05:33:18,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:33:18,576 INFO L204 MainTranslator]: Completed translation [2024-11-28 05:33:18,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:33:18 WrapperNode [2024-11-28 05:33:18,577 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:33:18,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 05:33:18,579 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 05:33:18,579 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 05:33:18,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:33:18" (1/1) ... [2024-11-28 05:33:18,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:33:18" (1/1) ... [2024-11-28 05:33:18,641 INFO L138 Inliner]: procedures = 130, calls = 41, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 142 [2024-11-28 05:33:18,641 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 05:33:18,642 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 05:33:18,642 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 05:33:18,642 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 05:33:18,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:33:18" (1/1) ... [2024-11-28 05:33:18,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:33:18" (1/1) ... [2024-11-28 05:33:18,659 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:33:18" (1/1) ... [2024-11-28 05:33:18,686 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 16, 6]. 67 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 9 writes are split as follows [0, 8, 1]. [2024-11-28 05:33:18,686 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:33:18" (1/1) ... [2024-11-28 05:33:18,687 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:33:18" (1/1) ... [2024-11-28 05:33:18,702 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:33:18" (1/1) ... [2024-11-28 05:33:18,703 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:33:18" (1/1) ... [2024-11-28 05:33:18,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:33:18" (1/1) ... [2024-11-28 05:33:18,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:33:18" (1/1) ... [2024-11-28 05:33:18,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:33:18" (1/1) ... [2024-11-28 05:33:18,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 05:33:18,718 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 05:33:18,718 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 05:33:18,718 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 05:33:18,720 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:33:18" (1/1) ... [2024-11-28 05:33:18,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:33:18,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:33:18,765 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 05:33:18,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 05:33:18,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-28 05:33:18,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-28 05:33:18,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-28 05:33:18,807 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-28 05:33:18,808 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-28 05:33:18,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 05:33:18,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 05:33:18,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 05:33:18,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 05:33:18,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 05:33:18,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 05:33:18,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 05:33:18,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 05:33:18,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 05:33:18,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 05:33:18,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-28 05:33:18,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-28 05:33:18,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-28 05:33:18,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-28 05:33:18,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-28 05:33:18,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-28 05:33:18,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 05:33:18,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-28 05:33:18,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-28 05:33:18,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 05:33:18,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 05:33:19,061 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 05:33:19,064 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 05:33:19,851 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-11-28 05:33:19,851 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 05:33:19,865 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 05:33:19,868 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-28 05:33:19,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:33:19 BoogieIcfgContainer [2024-11-28 05:33:19,869 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 05:33:19,872 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 05:33:19,872 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 05:33:19,881 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 05:33:19,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:33:17" (1/3) ... [2024-11-28 05:33:19,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b91cc4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:33:19, skipping insertion in model container [2024-11-28 05:33:19,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:33:18" (2/3) ... [2024-11-28 05:33:19,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b91cc4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:33:19, skipping insertion in model container [2024-11-28 05:33:19,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:33:19" (3/3) ... [2024-11-28 05:33:19,886 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2024-11-28 05:33:19,905 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 05:33:19,906 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_append_unequal.i that has 2 procedures, 112 locations, 1 initial locations, 4 loop locations, and 47 error locations. [2024-11-28 05:33:19,954 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 05:33:19,971 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;@70bc05b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 05:33:19,972 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2024-11-28 05:33:19,979 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 108 states have internal predecessors, (124), 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 05:33:19,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-28 05:33:19,986 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:33:19,986 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:33:19,988 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:33:19,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:33:19,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1813470804, now seen corresponding path program 1 times [2024-11-28 05:33:20,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:33:20,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2003488060] [2024-11-28 05:33:20,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:33:20,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:33:20,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:33:20,018 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:33:20,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 05:33:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:33:20,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 05:33:20,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:33:20,231 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 7 [2024-11-28 05:33:20,293 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 05:33:20,293 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:33:20,294 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:33:20,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003488060] [2024-11-28 05:33:20,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003488060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:33:20,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:33:20,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:33:20,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246192010] [2024-11-28 05:33:20,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:33:20,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:33:20,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:33:20,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:33:20,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:33:20,338 INFO L87 Difference]: Start difference. First operand has 112 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 108 states have internal predecessors, (124), 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 05:33:20,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:33:20,651 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2024-11-28 05:33:20,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:33:20,655 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 05:33:20,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:33:20,665 INFO L225 Difference]: With dead ends: 108 [2024-11-28 05:33:20,666 INFO L226 Difference]: Without dead ends: 105 [2024-11-28 05:33:20,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 05:33:20,674 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 3 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:33:20,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 174 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 05:33:20,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-28 05:33:20,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-28 05:33:20,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 58 states have (on average 1.896551724137931) internal successors, (110), 101 states have internal predecessors, (110), 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 05:33:20,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2024-11-28 05:33:20,724 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 7 [2024-11-28 05:33:20,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:33:20,725 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2024-11-28 05:33:20,725 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 05:33:20,725 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2024-11-28 05:33:20,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-28 05:33:20,726 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:33:20,727 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:33:20,734 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 05:33:20,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:33:20,928 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:33:20,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:33:20,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1813470805, now seen corresponding path program 1 times [2024-11-28 05:33:20,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:33:20,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1265996716] [2024-11-28 05:33:20,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:33:20,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:33:20,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:33:20,932 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:33:20,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 05:33:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:33:21,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 05:33:21,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:33:21,059 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:33:21,096 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 05:33:21,096 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:33:21,096 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:33:21,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265996716] [2024-11-28 05:33:21,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265996716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:33:21,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:33:21,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:33:21,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283134994] [2024-11-28 05:33:21,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:33:21,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:33:21,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:33:21,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:33:21,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:33:21,099 INFO L87 Difference]: Start difference. First operand 105 states and 114 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 05:33:21,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:33:21,377 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2024-11-28 05:33:21,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:33:21,379 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 05:33:21,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:33:21,380 INFO L225 Difference]: With dead ends: 102 [2024-11-28 05:33:21,380 INFO L226 Difference]: Without dead ends: 102 [2024-11-28 05:33:21,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 05:33:21,381 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 3 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:33:21,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 173 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 05:33:21,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-28 05:33:21,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-28 05:33:21,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 58 states have (on average 1.8448275862068966) internal successors, (107), 98 states have internal predecessors, (107), 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 05:33:21,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2024-11-28 05:33:21,391 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 7 [2024-11-28 05:33:21,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:33:21,391 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2024-11-28 05:33:21,391 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 05:33:21,391 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2024-11-28 05:33:21,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-28 05:33:21,392 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:33:21,392 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:33:21,403 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 05:33:21,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:33:21,593 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:33:21,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:33:21,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1810188849, now seen corresponding path program 1 times [2024-11-28 05:33:21,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:33:21,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [933011518] [2024-11-28 05:33:21,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:33:21,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:33:21,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:33:21,597 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:33:21,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 05:33:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:33:21,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-28 05:33:21,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:33:21,753 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:33:21,947 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 05:33:21,947 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:33:21,947 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:33:21,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933011518] [2024-11-28 05:33:21,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933011518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:33:21,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:33:21,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:33:21,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741390176] [2024-11-28 05:33:21,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:33:21,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:33:21,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:33:21,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:33:21,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:33:21,951 INFO L87 Difference]: Start difference. First operand 102 states and 111 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 05:33:22,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:33:22,602 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2024-11-28 05:33:22,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:33:22,604 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 05:33:22,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:33:22,605 INFO L225 Difference]: With dead ends: 100 [2024-11-28 05:33:22,605 INFO L226 Difference]: Without dead ends: 100 [2024-11-28 05:33:22,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:33:22,606 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 7 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:33:22,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 334 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 05:33:22,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-28 05:33:22,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-28 05:33:22,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 58 states have (on average 1.8103448275862069) internal successors, (105), 96 states have internal predecessors, (105), 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 05:33:22,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2024-11-28 05:33:22,620 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 14 [2024-11-28 05:33:22,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:33:22,622 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2024-11-28 05:33:22,622 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 05:33:22,622 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2024-11-28 05:33:22,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-28 05:33:22,623 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:33:22,623 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:33:22,634 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 05:33:22,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:33:22,828 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:33:22,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:33:22,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1810188848, now seen corresponding path program 1 times [2024-11-28 05:33:22,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:33:22,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1414670770] [2024-11-28 05:33:22,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:33:22,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:33:22,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:33:22,833 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:33:22,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 05:33:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:33:22,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 05:33:22,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:33:23,035 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 05:33:23,035 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:33:23,035 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:33:23,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414670770] [2024-11-28 05:33:23,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414670770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:33:23,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:33:23,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:33:23,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219791315] [2024-11-28 05:33:23,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:33:23,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:33:23,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:33:23,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:33:23,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:33:23,037 INFO L87 Difference]: Start difference. First operand 100 states and 109 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 05:33:23,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:33:23,654 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2024-11-28 05:33:23,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:33:23,655 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 05:33:23,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:33:23,656 INFO L225 Difference]: With dead ends: 98 [2024-11-28 05:33:23,656 INFO L226 Difference]: Without dead ends: 98 [2024-11-28 05:33:23,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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 05:33:23,657 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 8 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:33:23,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 318 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 05:33:23,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-28 05:33:23,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-28 05:33:23,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 94 states have internal predecessors, (103), 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 05:33:23,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2024-11-28 05:33:23,665 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 14 [2024-11-28 05:33:23,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:33:23,666 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2024-11-28 05:33:23,666 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 05:33:23,666 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2024-11-28 05:33:23,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-28 05:33:23,667 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:33:23,667 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:33:23,685 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-28 05:33:23,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:33:23,868 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:33:23,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:33:23,868 INFO L85 PathProgramCache]: Analyzing trace with hash -998761136, now seen corresponding path program 1 times [2024-11-28 05:33:23,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:33:23,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2007428431] [2024-11-28 05:33:23,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:33:23,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:33:23,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:33:23,873 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:33:23,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 05:33:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:33:24,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 05:33:24,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:33:24,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:33:24,026 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:33:24,026 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:33:24,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007428431] [2024-11-28 05:33:24,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007428431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:33:24,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:33:24,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:33:24,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959413095] [2024-11-28 05:33:24,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:33:24,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:33:24,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:33:24,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:33:24,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:33:24,032 INFO L87 Difference]: Start difference. First operand 98 states and 107 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 05:33:24,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:33:24,051 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2024-11-28 05:33:24,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:33:24,052 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 05:33:24,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:33:24,053 INFO L225 Difference]: With dead ends: 108 [2024-11-28 05:33:24,053 INFO L226 Difference]: Without dead ends: 108 [2024-11-28 05:33:24,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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 05:33:24,054 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 9 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 207 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 05:33:24,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 207 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:33:24,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-28 05:33:24,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 99. [2024-11-28 05:33:24,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 95 states have internal predecessors, (104), 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 05:33:24,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2024-11-28 05:33:24,074 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 16 [2024-11-28 05:33:24,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:33:24,074 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2024-11-28 05:33:24,074 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 05:33:24,075 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2024-11-28 05:33:24,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-28 05:33:24,075 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:33:24,075 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 05:33:24,093 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 05:33:24,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:33:24,276 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:33:24,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:33:24,277 INFO L85 PathProgramCache]: Analyzing trace with hash -273410556, now seen corresponding path program 1 times [2024-11-28 05:33:24,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:33:24,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1984354767] [2024-11-28 05:33:24,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:33:24,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:33:24,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:33:24,282 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:33:24,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 05:33:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:33:24,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 05:33:24,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:33:24,469 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 05:33:24,470 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:33:24,470 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:33:24,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984354767] [2024-11-28 05:33:24,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984354767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:33:24,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:33:24,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:33:24,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676941028] [2024-11-28 05:33:24,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:33:24,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:33:24,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:33:24,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:33:24,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:33:24,472 INFO L87 Difference]: Start difference. First operand 99 states and 108 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 05:33:24,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:33:24,526 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2024-11-28 05:33:24,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:33:24,528 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 05:33:24,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:33:24,529 INFO L225 Difference]: With dead ends: 104 [2024-11-28 05:33:24,529 INFO L226 Difference]: Without dead ends: 104 [2024-11-28 05:33:24,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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 05:33:24,532 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 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 05:33:24,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:33:24,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-28 05:33:24,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-28 05:33:24,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 63 states have (on average 1.7142857142857142) internal successors, (108), 99 states have internal predecessors, (108), 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 05:33:24,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2024-11-28 05:33:24,555 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 17 [2024-11-28 05:33:24,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:33:24,556 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2024-11-28 05:33:24,556 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 05:33:24,556 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2024-11-28 05:33:24,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-28 05:33:24,557 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:33:24,557 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 05:33:24,571 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 05:33:24,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:33:24,758 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:33:24,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:33:24,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1870851471, now seen corresponding path program 1 times [2024-11-28 05:33:24,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:33:24,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1784440032] [2024-11-28 05:33:24,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:33:24,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:33:24,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:33:24,761 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:33:24,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 05:33:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:33:24,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 05:33:24,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:33:24,978 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 05:33:24,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:33:25,080 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 05:33:25,084 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:33:25,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784440032] [2024-11-28 05:33:25,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784440032] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:33:25,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:33:25,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2024-11-28 05:33:25,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407621418] [2024-11-28 05:33:25,085 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:33:25,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:33:25,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:33:25,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:33:25,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:33:25,087 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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 05:33:25,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:33:25,191 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2024-11-28 05:33:25,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 05:33:25,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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 05:33:25,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:33:25,193 INFO L225 Difference]: With dead ends: 126 [2024-11-28 05:33:25,193 INFO L226 Difference]: Without dead ends: 126 [2024-11-28 05:33:25,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:33:25,196 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 34 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:33:25,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 522 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:33:25,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-28 05:33:25,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2024-11-28 05:33:25,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 79 states have (on average 1.6582278481012658) internal successors, (131), 115 states have internal predecessors, (131), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 05:33:25,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 141 transitions. [2024-11-28 05:33:25,218 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 141 transitions. Word has length 31 [2024-11-28 05:33:25,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:33:25,218 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 141 transitions. [2024-11-28 05:33:25,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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 05:33:25,219 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2024-11-28 05:33:25,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-28 05:33:25,220 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:33:25,220 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 05:33:25,235 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 05:33:25,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:33:25,421 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:33:25,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:33:25,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1538407165, now seen corresponding path program 1 times [2024-11-28 05:33:25,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:33:25,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [325247237] [2024-11-28 05:33:25,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:33:25,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:33:25,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:33:25,424 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:33:25,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 05:33:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:33:25,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-28 05:33:25,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:33:25,768 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-28 05:33:25,892 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-28 05:33:25,893 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 21 treesize of output 20 [2024-11-28 05:33:25,918 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-28 05:33:25,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:33:26,332 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:33:26,333 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:33:26,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325247237] [2024-11-28 05:33:26,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325247237] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:33:26,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:33:26,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2024-11-28 05:33:26,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383759657] [2024-11-28 05:33:26,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:33:26,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 05:33:26,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:33:26,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 05:33:26,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=57, Unknown=1, NotChecked=14, Total=90 [2024-11-28 05:33:26,334 INFO L87 Difference]: Start difference. First operand 122 states and 141 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 05:33:27,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:33:27,431 INFO L93 Difference]: Finished difference Result 121 states and 138 transitions. [2024-11-28 05:33:27,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:33:27,432 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2024-11-28 05:33:27,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:33:27,433 INFO L225 Difference]: With dead ends: 121 [2024-11-28 05:33:27,433 INFO L226 Difference]: Without dead ends: 121 [2024-11-28 05:33:27,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=125, Unknown=1, NotChecked=22, Total=182 [2024-11-28 05:33:27,434 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 5 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:33:27,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 414 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 346 Invalid, 0 Unknown, 106 Unchecked, 1.0s Time] [2024-11-28 05:33:27,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-28 05:33:27,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-28 05:33:27,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 79 states have (on average 1.620253164556962) internal successors, (128), 114 states have internal predecessors, (128), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 05:33:27,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 138 transitions. [2024-11-28 05:33:27,450 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 138 transitions. Word has length 32 [2024-11-28 05:33:27,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:33:27,450 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 138 transitions. [2024-11-28 05:33:27,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 05:33:27,450 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 138 transitions. [2024-11-28 05:33:27,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-28 05:33:27,451 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:33:27,451 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 05:33:27,465 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-28 05:33:27,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:33:27,652 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:33:27,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:33:27,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1538407164, now seen corresponding path program 1 times [2024-11-28 05:33:27,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:33:27,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1561925851] [2024-11-28 05:33:27,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:33:27,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:33:27,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:33:27,656 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:33:27,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 05:33:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:33:27,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-28 05:33:27,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:33:27,854 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:33:28,258 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-28 05:33:28,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:33:28,357 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:33:28,393 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:33:28,394 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 13 treesize of output 13 [2024-11-28 05:33:28,462 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-28 05:33:28,463 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:33:28,801 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:33:28,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561925851] [2024-11-28 05:33:28,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561925851] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:33:28,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1171656235] [2024-11-28 05:33:28,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:33:28,802 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 05:33:28,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 05:33:28,810 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 05:33:28,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-28 05:33:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:33:29,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-28 05:33:29,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:33:29,246 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 7 [2024-11-28 05:33:29,257 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:33:29,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:33:29,610 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:33:29,630 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:33:29,630 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 13 treesize of output 13 [2024-11-28 05:33:29,671 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-28 05:33:29,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:33:34,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1171656235] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:33:34,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:33:34,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 [2024-11-28 05:33:34,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825350383] [2024-11-28 05:33:34,027 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:33:34,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 05:33:34,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:33:34,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 05:33:34,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=107, Unknown=1, NotChecked=20, Total=156 [2024-11-28 05:33:34,030 INFO L87 Difference]: Start difference. First operand 121 states and 138 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 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 05:33:35,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:33:35,782 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2024-11-28 05:33:35,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:33:35,783 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 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 32 [2024-11-28 05:33:35,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:33:35,784 INFO L225 Difference]: With dead ends: 120 [2024-11-28 05:33:35,784 INFO L226 Difference]: Without dead ends: 120 [2024-11-28 05:33:35,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=45, Invalid=198, Unknown=1, NotChecked=28, Total=272 [2024-11-28 05:33:35,785 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 4 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:33:35,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 402 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 464 Invalid, 0 Unknown, 105 Unchecked, 1.5s Time] [2024-11-28 05:33:35,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-28 05:33:35,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-28 05:33:35,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 79 states have (on average 1.5822784810126582) internal successors, (125), 113 states have internal predecessors, (125), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 05:33:35,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 135 transitions. [2024-11-28 05:33:35,792 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 135 transitions. Word has length 32 [2024-11-28 05:33:35,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:33:35,793 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 135 transitions. [2024-11-28 05:33:35,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 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 05:33:35,793 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 135 transitions. [2024-11-28 05:33:35,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-28 05:33:35,794 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:33:35,795 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 05:33:35,803 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-11-28 05:33:36,003 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 05:33:36,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:33:36,196 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:33:36,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:33:36,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1763514160, now seen corresponding path program 2 times [2024-11-28 05:33:36,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:33:36,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [270285997] [2024-11-28 05:33:36,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:33:36,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:33:36,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:33:36,201 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:33:36,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 05:33:36,630 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:33:36,630 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:33:36,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 05:33:36,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:33:36,775 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 05:33:36,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:33:36,894 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 05:33:36,896 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:33:36,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270285997] [2024-11-28 05:33:36,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270285997] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:33:36,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:33:36,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2024-11-28 05:33:36,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031748094] [2024-11-28 05:33:36,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:33:36,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:33:36,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:33:36,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:33:36,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:33:36,898 INFO L87 Difference]: Start difference. First operand 120 states and 135 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 05:33:37,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:33:37,303 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2024-11-28 05:33:37,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 05:33:37,304 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 05:33:37,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:33:37,305 INFO L225 Difference]: With dead ends: 120 [2024-11-28 05:33:37,305 INFO L226 Difference]: Without dead ends: 120 [2024-11-28 05:33:37,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:33:37,308 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 4 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 561 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.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:33:37,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 561 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 05:33:37,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-28 05:33:37,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-28 05:33:37,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 113 states have internal predecessors, (122), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 05:33:37,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2024-11-28 05:33:37,316 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 46 [2024-11-28 05:33:37,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:33:37,317 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2024-11-28 05:33:37,317 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 05:33:37,317 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2024-11-28 05:33:37,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 05:33:37,319 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:33:37,321 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 05:33:37,337 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-28 05:33:37,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:33:37,522 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:33:37,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:33:37,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1998206232, now seen corresponding path program 1 times [2024-11-28 05:33:37,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:33:37,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1922336526] [2024-11-28 05:33:37,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:33:37,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:33:37,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:33:37,526 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:33:37,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 05:33:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:33:37,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-28 05:33:37,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:33:37,784 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 7 [2024-11-28 05:33:37,998 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-28 05:33:37,999 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 27 [2024-11-28 05:33:38,255 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-28 05:33:38,410 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2024-11-28 05:33:38,411 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 28 treesize of output 36 [2024-11-28 05:33:38,693 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|)) is different from true [2024-11-28 05:33:38,785 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2024-11-28 05:33:38,785 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 21 treesize of output 32 [2024-11-28 05:33:38,859 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 21 not checked. [2024-11-28 05:33:38,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:33:55,792 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:33:55,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922336526] [2024-11-28 05:33:55,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922336526] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:33:55,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [806148315] [2024-11-28 05:33:55,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:33:55,793 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 05:33:55,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 05:33:55,798 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 05:33:55,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-28 05:33:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:33:56,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-28 05:33:56,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:33:56,447 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-28 05:33:56,447 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 20 [2024-11-28 05:33:56,532 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-28 05:33:56,532 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 11 [2024-11-28 05:33:56,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:33:56,810 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2024-11-28 05:33:56,811 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 23 treesize of output 29 [2024-11-28 05:33:57,129 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-28 05:33:57,129 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 24 treesize of output 20 [2024-11-28 05:33:57,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:33:57,434 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2024-11-28 05:33:57,434 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 32 treesize of output 38 [2024-11-28 05:33:57,987 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-28 05:33:57,988 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 24 treesize of output 20 [2024-11-28 05:33:58,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:33:58,234 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2024-11-28 05:33:58,234 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 32 treesize of output 38 [2024-11-28 05:33:58,462 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-28 05:33:58,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:33:58,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [806148315] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:33:58,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:33:58,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 20 [2024-11-28 05:33:58,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013695589] [2024-11-28 05:33:58,635 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:33:58,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 05:33:58,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:33:58,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 05:33:58,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=431, Unknown=6, NotChecked=86, Total=600 [2024-11-28 05:33:58,636 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand has 21 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 17 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 05:34:03,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:34:03,244 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2024-11-28 05:34:03,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 05:34:03,244 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 17 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2024-11-28 05:34:03,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:34:03,246 INFO L225 Difference]: With dead ends: 128 [2024-11-28 05:34:03,246 INFO L226 Difference]: Without dead ends: 128 [2024-11-28 05:34:03,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 100 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=158, Invalid=836, Unknown=6, NotChecked=122, Total=1122 [2024-11-28 05:34:03,247 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 396 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 218 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:34:03,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 524 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 615 Invalid, 0 Unknown, 218 Unchecked, 2.7s Time] [2024-11-28 05:34:03,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-28 05:34:03,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 115. [2024-11-28 05:34:03,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 79 states have (on average 1.481012658227848) internal successors, (117), 108 states have internal predecessors, (117), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 05:34:03,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2024-11-28 05:34:03,253 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 47 [2024-11-28 05:34:03,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:34:03,254 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2024-11-28 05:34:03,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 17 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 05:34:03,254 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2024-11-28 05:34:03,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 05:34:03,257 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:34:03,257 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 05:34:03,265 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2024-11-28 05:34:03,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-28 05:34:03,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:34:03,659 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:34:03,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:34:03,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1998206231, now seen corresponding path program 1 times [2024-11-28 05:34:03,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:34:03,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1436124717] [2024-11-28 05:34:03,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:34:03,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:34:03,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:34:03,663 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:34:03,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 05:34:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:34:03,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-28 05:34:03,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:34:03,894 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 7 [2024-11-28 05:34:03,902 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:34:03,978 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-28 05:34:04,144 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-28 05:34:04,144 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 21 treesize of output 20 [2024-11-28 05:34:04,159 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:34:04,268 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-28 05:34:04,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:34:04,345 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:34:04,369 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:34:04,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 13 treesize of output 13 [2024-11-28 05:34:04,489 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv12 32)) |c_#length|)) is different from true [2024-11-28 05:34:04,544 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-28 05:34:04,544 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 18 [2024-11-28 05:34:04,625 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 21 not checked. [2024-11-28 05:34:04,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:34:04,890 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:34:04,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436124717] [2024-11-28 05:34:04,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436124717] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:34:04,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1300835621] [2024-11-28 05:34:04,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:34:04,890 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 05:34:04,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 05:34:04,893 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 05:34:04,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-11-28 05:34:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:34:05,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-28 05:34:05,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:34:05,471 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:34:05,531 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 05:34:05,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:34:05,735 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:34:05,913 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 05:34:06,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:34:06,158 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:34:06,427 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 05:34:06,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:34:06,607 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:34:06,693 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-28 05:34:06,693 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:34:06,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1300835621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:34:06,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 05:34:06,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 17 [2024-11-28 05:34:06,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338207088] [2024-11-28 05:34:06,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:34:06,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:34:06,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:34:06,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:34:06,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=223, Unknown=3, NotChecked=96, Total=380 [2024-11-28 05:34:06,696 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 05:34:10,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:34:15,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:34:20,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:34:24,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:34:29,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:34:29,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:34:29,901 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2024-11-28 05:34:29,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 05:34:29,902 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 47 [2024-11-28 05:34:29,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:34:29,903 INFO L225 Difference]: With dead ends: 111 [2024-11-28 05:34:29,903 INFO L226 Difference]: Without dead ends: 111 [2024-11-28 05:34:29,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=247, Unknown=3, NotChecked=102, Total=420 [2024-11-28 05:34:29,905 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 60 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 6 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:34:29,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 302 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 221 Invalid, 6 Unknown, 0 Unchecked, 23.1s Time] [2024-11-28 05:34:29,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-28 05:34:29,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-28 05:34:29,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 103 states have internal predecessors, (112), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 05:34:29,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2024-11-28 05:34:29,911 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 47 [2024-11-28 05:34:29,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:34:29,912 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2024-11-28 05:34:29,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 05:34:29,912 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2024-11-28 05:34:29,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-28 05:34:29,913 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:34:29,913 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 05:34:29,921 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2024-11-28 05:34:30,122 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-28 05:34:30,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:34:30,314 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:34:30,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:34:30,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1178693715, now seen corresponding path program 1 times [2024-11-28 05:34:30,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:34:30,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1635334603] [2024-11-28 05:34:30,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:34:30,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:34:30,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:34:30,317 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:34:30,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-28 05:34:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:34:30,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-28 05:34:30,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:34:31,128 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 5 [2024-11-28 05:34:31,260 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-28 05:34:31,548 INFO L349 Elim1Store]: treesize reduction 36, result has 35.7 percent of original size [2024-11-28 05:34:31,548 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 25 treesize of output 28 [2024-11-28 05:34:31,614 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 19 treesize of output 11 [2024-11-28 05:34:31,860 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 5 not checked. [2024-11-28 05:34:31,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:34:39,294 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 20 treesize of output 12 [2024-11-28 05:34:39,539 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 05:34:39,539 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:34:39,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635334603] [2024-11-28 05:34:39,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635334603] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:34:39,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:34:39,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2024-11-28 05:34:39,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725987249] [2024-11-28 05:34:39,540 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:34:39,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 05:34:39,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:34:39,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 05:34:39,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=133, Unknown=1, NotChecked=22, Total=182 [2024-11-28 05:34:39,542 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 05:34:43,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:34:43,870 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2024-11-28 05:34:43,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 05:34:43,871 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 51 [2024-11-28 05:34:43,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:34:43,872 INFO L225 Difference]: With dead ends: 109 [2024-11-28 05:34:43,872 INFO L226 Difference]: Without dead ends: 109 [2024-11-28 05:34:43,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=42, Invalid=233, Unknown=1, NotChecked=30, Total=306 [2024-11-28 05:34:43,873 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 14 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:34:43,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 491 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 554 Invalid, 0 Unknown, 94 Unchecked, 3.9s Time] [2024-11-28 05:34:43,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-28 05:34:43,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-28 05:34:43,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 80 states have (on average 1.4) internal successors, (112), 102 states have internal predecessors, (112), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 05:34:43,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2024-11-28 05:34:43,879 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 51 [2024-11-28 05:34:43,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:34:43,880 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2024-11-28 05:34:43,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 05:34:43,880 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2024-11-28 05:34:43,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-28 05:34:43,881 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:34:43,881 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 05:34:43,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-28 05:34:44,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:34:44,082 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-28 05:34:44,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:34:44,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1178693714, now seen corresponding path program 1 times [2024-11-28 05:34:44,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:34:44,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1650772263] [2024-11-28 05:34:44,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:34:44,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:34:44,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:34:44,086 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:34:44,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f14f817-c2e2-45e9-b6ce-f3f11da142a5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-28 05:34:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:34:44,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-28 05:34:44,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:34:44,379 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:34:45,663 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:34:45,676 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 5 [2024-11-28 05:34:45,894 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_5|) (_ bv0 32))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2024-11-28 05:34:46,234 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-28 05:34:46,234 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 17 treesize of output 17 [2024-11-28 05:34:46,249 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:34:46,558 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:34:46,888 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 05:34:46,889 INFO L312 TraceCheckSpWp]: Computing backward predicates...