./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/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_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:39:33,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:39:33,461 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 02:39:33,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:39:33,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:39:33,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:39:33,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:39:33,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:39:33,492 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:39:33,492 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:39:33,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:39:33,493 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:39:33,493 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:39:33,493 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:39:33,493 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:39:33,494 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:39:33,494 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 02:39:33,494 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:39:33,494 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:39:33,494 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:39:33,494 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:39:33,495 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 02:39:33,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:39:33,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 02:39:33,495 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:39:33,495 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 02:39:33,495 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:39:33,495 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:39:33,496 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:39:33,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:39:33,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:39:33,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:39:33,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:39:33,496 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:39:33,497 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:39:33,497 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:39:33,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:39:33,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:39:33,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:39:33,497 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:39:33,498 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 02:39:33,498 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 02:39:33,498 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 02:39:33,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 02:39:33,498 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:39:33,498 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:39:33,498 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:39:33,498 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:39:33,499 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_e4d484fc-1c06-498a-b28e-56647a6fca83/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 ! call(reach_error())) ) 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 -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2024-11-28 02:39:33,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:39:33,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:39:33,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:39:33,811 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:39:33,812 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:39:33,813 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2024-11-28 02:39:36,987 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/data/35087f7ee/4a79f3058cf84f0fba26a700fb24b406/FLAG6e6be4dbd [2024-11-28 02:39:37,299 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:39:37,300 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2024-11-28 02:39:37,331 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/data/35087f7ee/4a79f3058cf84f0fba26a700fb24b406/FLAG6e6be4dbd [2024-11-28 02:39:37,551 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/data/35087f7ee/4a79f3058cf84f0fba26a700fb24b406 [2024-11-28 02:39:37,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:39:37,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:39:37,560 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:39:37,561 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:39:37,566 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:39:37,567 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:39:37" (1/1) ... [2024-11-28 02:39:37,568 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13f24af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:37, skipping insertion in model container [2024-11-28 02:39:37,568 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:39:37" (1/1) ... [2024-11-28 02:39:37,597 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:39:37,905 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2024-11-28 02:39:37,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:39:37,921 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:39:37,993 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2024-11-28 02:39:37,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:39:38,029 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:39:38,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:38 WrapperNode [2024-11-28 02:39:38,030 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:39:38,032 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:39:38,032 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:39:38,032 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:39:38,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:38" (1/1) ... [2024-11-28 02:39:38,058 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:38" (1/1) ... [2024-11-28 02:39:38,090 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 117 [2024-11-28 02:39:38,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:39:38,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:39:38,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:39:38,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:39:38,106 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:38" (1/1) ... [2024-11-28 02:39:38,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:38" (1/1) ... [2024-11-28 02:39:38,113 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:38" (1/1) ... [2024-11-28 02:39:38,154 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 6, 9]. 53 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 1, 4]. [2024-11-28 02:39:38,156 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:38" (1/1) ... [2024-11-28 02:39:38,156 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:38" (1/1) ... [2024-11-28 02:39:38,171 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:38" (1/1) ... [2024-11-28 02:39:38,172 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:38" (1/1) ... [2024-11-28 02:39:38,179 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:38" (1/1) ... [2024-11-28 02:39:38,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:38" (1/1) ... [2024-11-28 02:39:38,186 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:38" (1/1) ... [2024-11-28 02:39:38,191 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:39:38,192 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:39:38,192 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:39:38,192 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:39:38,197 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:38" (1/1) ... [2024-11-28 02:39:38,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:39:38,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:39:38,244 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:39:38,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:39:38,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 02:39:38,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 02:39:38,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-28 02:39:38,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 02:39:38,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 02:39:38,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-28 02:39:38,285 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-28 02:39:38,285 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-28 02:39:38,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 02:39:38,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:39:38,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 02:39:38,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 02:39:38,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 02:39:38,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 02:39:38,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 02:39:38,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 02:39:38,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 02:39:38,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 02:39:38,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-28 02:39:38,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-28 02:39:38,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-28 02:39:38,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 02:39:38,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 02:39:38,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 02:39:38,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:39:38,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:39:38,447 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:39:38,449 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:39:38,736 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-28 02:39:38,736 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:39:38,746 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:39:38,746 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-28 02:39:38,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:39:38 BoogieIcfgContainer [2024-11-28 02:39:38,747 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:39:38,749 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:39:38,749 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:39:38,754 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:39:38,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:39:37" (1/3) ... [2024-11-28 02:39:38,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b4cc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:39:38, skipping insertion in model container [2024-11-28 02:39:38,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:38" (2/3) ... [2024-11-28 02:39:38,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b4cc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:39:38, skipping insertion in model container [2024-11-28 02:39:38,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:39:38" (3/3) ... [2024-11-28 02:39:38,757 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2024-11-28 02:39:38,778 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:39:38,779 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_append_equal.i that has 2 procedures, 33 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2024-11-28 02:39:38,835 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:39:38,847 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=LoopHeads, 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;@5196350d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:39:38,847 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 02:39:38,854 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 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 02:39:38,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-28 02:39:38,861 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:38,862 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 02:39:38,863 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:39:38,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:38,868 INFO L85 PathProgramCache]: Analyzing trace with hash 359581376, now seen corresponding path program 1 times [2024-11-28 02:39:38,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:38,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464338187] [2024-11-28 02:39:38,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:38,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:39,292 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 02:39:39,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:39,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464338187] [2024-11-28 02:39:39,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464338187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:39,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:39,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:39:39,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465643910] [2024-11-28 02:39:39,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:39,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:39:39,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:39,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:39:39,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:39:39,322 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 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, 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 02:39:39,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:39,367 INFO L93 Difference]: Finished difference Result 64 states and 88 transitions. [2024-11-28 02:39:39,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:39:39,370 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 02:39:39,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:39,376 INFO L225 Difference]: With dead ends: 64 [2024-11-28 02:39:39,377 INFO L226 Difference]: Without dead ends: 29 [2024-11-28 02:39:39,381 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 02:39:39,385 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 73 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 02:39:39,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:39:39,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-28 02:39:39,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-11-28 02:39:39,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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 02:39:39,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-11-28 02:39:39,430 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 17 [2024-11-28 02:39:39,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:39,431 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-11-28 02:39:39,431 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 02:39:39,432 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-11-28 02:39:39,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-28 02:39:39,433 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:39,434 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:39:39,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 02:39:39,434 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:39:39,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:39,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1965184245, now seen corresponding path program 1 times [2024-11-28 02:39:39,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:39,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907816302] [2024-11-28 02:39:39,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:39,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:39,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 02:39:39,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:39,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907816302] [2024-11-28 02:39:39,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907816302] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:39:39,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911084504] [2024-11-28 02:39:39,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:39,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:39:39,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:39:39,684 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:39:39,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 02:39:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:39,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 02:39:39,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:39:40,013 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:40,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:39:40,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 02:39:40,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911084504] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:39:40,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:39:40,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-28 02:39:40,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212315137] [2024-11-28 02:39:40,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:39:40,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:39:40,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:40,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:39:40,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:39:40,093 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 02:39:40,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:40,130 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2024-11-28 02:39:40,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:39:40,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 25 [2024-11-28 02:39:40,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:40,132 INFO L225 Difference]: With dead ends: 51 [2024-11-28 02:39:40,132 INFO L226 Difference]: Without dead ends: 30 [2024-11-28 02:39:40,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 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 02:39:40,133 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:39:40,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 79 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:39:40,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-28 02:39:40,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-28 02:39:40,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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 02:39:40,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2024-11-28 02:39:40,142 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 25 [2024-11-28 02:39:40,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:40,143 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2024-11-28 02:39:40,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 02:39:40,144 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2024-11-28 02:39:40,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-28 02:39:40,144 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:40,144 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:39:40,152 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 02:39:40,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:39:40,345 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:39:40,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:40,346 INFO L85 PathProgramCache]: Analyzing trace with hash 429055530, now seen corresponding path program 2 times [2024-11-28 02:39:40,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:40,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686349742] [2024-11-28 02:39:40,346 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:39:40,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:40,388 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 02:39:40,388 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:39:40,724 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-28 02:39:40,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:40,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686349742] [2024-11-28 02:39:40,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686349742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:40,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:40,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 02:39:40,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881089077] [2024-11-28 02:39:40,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:40,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 02:39:40,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:40,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 02:39:40,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:39:40,726 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 1 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 02:39:40,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:40,847 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2024-11-28 02:39:40,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 02:39:40,849 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 1 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 33 [2024-11-28 02:39:40,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:40,851 INFO L225 Difference]: With dead ends: 42 [2024-11-28 02:39:40,851 INFO L226 Difference]: Without dead ends: 39 [2024-11-28 02:39:40,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-28 02:39:40,852 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 11 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:39:40,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 168 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:39:40,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-28 02:39:40,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2024-11-28 02:39:40,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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 02:39:40,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-11-28 02:39:40,863 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 33 [2024-11-28 02:39:40,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:40,863 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-11-28 02:39:40,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 1 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 02:39:40,863 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-11-28 02:39:40,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-28 02:39:40,864 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:40,864 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:39:40,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 02:39:40,866 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:39:40,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:40,867 INFO L85 PathProgramCache]: Analyzing trace with hash 415748665, now seen corresponding path program 1 times [2024-11-28 02:39:40,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:40,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010900019] [2024-11-28 02:39:40,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:40,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:41,999 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-28 02:39:41,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:41,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010900019] [2024-11-28 02:39:42,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010900019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:42,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:42,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 02:39:42,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765610238] [2024-11-28 02:39:42,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:42,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 02:39:42,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:42,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 02:39:42,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-28 02:39:42,001 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (2), 1 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 02:39:42,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:42,305 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2024-11-28 02:39:42,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 02:39:42,306 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (2), 1 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 34 [2024-11-28 02:39:42,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:42,309 INFO L225 Difference]: With dead ends: 42 [2024-11-28 02:39:42,309 INFO L226 Difference]: Without dead ends: 40 [2024-11-28 02:39:42,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-28 02:39:42,313 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:39:42,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 150 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 02:39:42,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-28 02:39:42,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2024-11-28 02:39:42,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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 02:39:42,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2024-11-28 02:39:42,325 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 34 [2024-11-28 02:39:42,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:42,325 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-11-28 02:39:42,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (2), 1 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 02:39:42,326 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2024-11-28 02:39:42,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-28 02:39:42,329 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:42,329 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:39:42,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 02:39:42,330 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:39:42,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:42,332 INFO L85 PathProgramCache]: Analyzing trace with hash 102540394, now seen corresponding path program 1 times [2024-11-28 02:39:42,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:42,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628903305] [2024-11-28 02:39:42,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:42,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:42,853 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 02:39:42,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:42,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628903305] [2024-11-28 02:39:42,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628903305] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:39:42,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740198352] [2024-11-28 02:39:42,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:42,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:39:42,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:39:42,857 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:39:42,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 02:39:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:43,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-28 02:39:43,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:39:43,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-28 02:39:43,344 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 02:39:43,348 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:39:43,434 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 02:39:43,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740198352] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:39:43,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:39:43,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 12 [2024-11-28 02:39:43,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819852804] [2024-11-28 02:39:43,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:39:43,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 02:39:43,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:43,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 02:39:43,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-28 02:39:43,437 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-28 02:39:47,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 02:39:51,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 02:39:55,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 02:39:55,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:55,688 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2024-11-28 02:39:55,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 02:39:55,691 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2024-11-28 02:39:55,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:55,692 INFO L225 Difference]: With dead ends: 45 [2024-11-28 02:39:55,692 INFO L226 Difference]: Without dead ends: 35 [2024-11-28 02:39:55,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-11-28 02:39:55,693 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 17 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:39:55,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 231 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 3 Unknown, 0 Unchecked, 12.1s Time] [2024-11-28 02:39:55,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-28 02:39:55,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-28 02:39:55,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 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 02:39:55,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-11-28 02:39:55,709 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 36 [2024-11-28 02:39:55,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:55,709 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-11-28 02:39:55,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-28 02:39:55,710 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-11-28 02:39:55,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-28 02:39:55,711 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:55,711 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:39:55,723 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 02:39:55,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:39:55,916 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:39:55,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:55,916 INFO L85 PathProgramCache]: Analyzing trace with hash 228210572, now seen corresponding path program 1 times [2024-11-28 02:39:55,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:55,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764116939] [2024-11-28 02:39:55,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:55,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:56,173 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-28 02:39:56,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:56,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764116939] [2024-11-28 02:39:56,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764116939] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:39:56,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595025507] [2024-11-28 02:39:56,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:56,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:39:56,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:39:56,176 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:39:56,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 02:39:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:56,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-28 02:39:56,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:39:56,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 16 treesize of output 8 [2024-11-28 02:39:56,562 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 02:39:56,563 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:39:56,647 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-28 02:39:56,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595025507] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:39:56,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:39:56,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 10 [2024-11-28 02:39:56,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744451898] [2024-11-28 02:39:56,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:39:56,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 02:39:56,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:56,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 02:39:56,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-28 02:39:56,650 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 02:40:00,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 02:40:04,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 02:40:08,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 02:40:08,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:40:08,844 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2024-11-28 02:40:08,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 02:40:08,845 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2024-11-28 02:40:08,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:40:08,846 INFO L225 Difference]: With dead ends: 40 [2024-11-28 02:40:08,846 INFO L226 Difference]: Without dead ends: 37 [2024-11-28 02:40:08,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-28 02:40:08,847 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:40:08,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 176 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 3 Unknown, 0 Unchecked, 12.1s Time] [2024-11-28 02:40:08,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-28 02:40:08,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2024-11-28 02:40:08,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 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 02:40:08,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2024-11-28 02:40:08,861 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 36 [2024-11-28 02:40:08,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:40:08,863 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-11-28 02:40:08,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 02:40:08,863 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2024-11-28 02:40:08,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-28 02:40:08,864 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:40:08,864 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:40:08,875 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 02:40:09,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:40:09,065 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:40:09,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:40:09,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1515477737, now seen corresponding path program 1 times [2024-11-28 02:40:09,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:40:09,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326805922] [2024-11-28 02:40:09,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:40:09,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:40:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:40:10,568 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 02:40:10,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:40:10,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326805922] [2024-11-28 02:40:10,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326805922] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:40:10,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772840612] [2024-11-28 02:40:10,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:40:10,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:40:10,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:40:10,571 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:40:10,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 02:40:10,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:40:10,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-11-28 02:40:10,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:40:11,101 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 02:40:11,128 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 02:40:11,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 02:40:11,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-28 02:40:11,537 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 02:40:11,722 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 02:40:11,742 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_3| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_3|) 0) 0)) (exists ((|node_create_#res#1.base| Int)) (let ((.cse0 (select |c_#memory_int#2| |node_create_#res#1.base|))) (and (= (store |c_old(#memory_int#2)| |node_create_#res#1.base| .cse0) |c_#memory_int#2|) (= (select |c_old(#valid)| |node_create_#res#1.base|) 0) (= (select .cse0 0) |c_node_create_#in~data#1|))))) is different from true [2024-11-28 02:40:11,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:40:11,846 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 02:40:11,875 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 02:40:11,875 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 02:40:12,272 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 34 treesize of output 25 [2024-11-28 02:40:12,412 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 27 treesize of output 15 [2024-11-28 02:40:12,585 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2024-11-28 02:40:12,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:40:12,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:40:12,926 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 1 case distinctions, treesize of input 41 treesize of output 42 [2024-11-28 02:40:13,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772840612] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:40:13,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:40:13,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2024-11-28 02:40:13,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511784338] [2024-11-28 02:40:13,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:40:13,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-28 02:40:13,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:40:13,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-28 02:40:13,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=897, Unknown=1, NotChecked=60, Total=1056 [2024-11-28 02:40:13,031 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 30 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 26 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-28 02:40:14,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:40:14,175 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2024-11-28 02:40:14,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 02:40:14,176 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 26 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2024-11-28 02:40:14,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:40:14,177 INFO L225 Difference]: With dead ends: 52 [2024-11-28 02:40:14,178 INFO L226 Difference]: Without dead ends: 50 [2024-11-28 02:40:14,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=156, Invalid=1569, Unknown=1, NotChecked=80, Total=1806 [2024-11-28 02:40:14,182 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 23 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:40:14,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 228 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 478 Invalid, 0 Unknown, 51 Unchecked, 0.6s Time] [2024-11-28 02:40:14,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-28 02:40:14,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2024-11-28 02:40:14,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 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 02:40:14,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2024-11-28 02:40:14,204 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 37 [2024-11-28 02:40:14,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:40:14,204 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2024-11-28 02:40:14,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 26 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-28 02:40:14,204 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2024-11-28 02:40:14,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-28 02:40:14,205 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:40:14,205 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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 02:40:14,218 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 02:40:14,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:40:14,406 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:40:14,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:40:14,407 INFO L85 PathProgramCache]: Analyzing trace with hash -380160056, now seen corresponding path program 1 times [2024-11-28 02:40:14,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:40:14,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589782787] [2024-11-28 02:40:14,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:40:14,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:40:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:40:15,429 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 02:40:15,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:40:15,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589782787] [2024-11-28 02:40:15,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589782787] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:40:15,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667477526] [2024-11-28 02:40:15,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:40:15,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:40:15,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:40:15,433 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:40:15,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 02:40:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:40:15,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-28 02:40:15,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:40:15,662 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 02:40:15,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:40:15,902 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 18 treesize of output 4 [2024-11-28 02:40:15,907 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 02:40:15,930 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_43| Int)) (and (= |c_#memory_$Pointer$#2.base| (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_43| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_43|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_43|) 0))) is different from true [2024-11-28 02:40:15,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:40:15,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2024-11-28 02:40:15,957 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 02:40:15,958 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 02:40:16,151 INFO L349 Elim1Store]: treesize reduction 59, result has 37.2 percent of original size [2024-11-28 02:40:16,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 42 [2024-11-28 02:40:16,167 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 26 treesize of output 18 [2024-11-28 02:40:16,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2024-11-28 02:40:16,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2024-11-28 02:40:16,290 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-28 02:40:16,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:40:16,666 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_48| Int) (v_ArrVal_675 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_48| v_ArrVal_675) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_48|) 0)))) is different from false [2024-11-28 02:40:16,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667477526] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:40:16,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:40:16,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 31 [2024-11-28 02:40:16,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954768556] [2024-11-28 02:40:16,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:40:16,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-28 02:40:16,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:40:16,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-28 02:40:16,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=911, Unknown=2, NotChecked=122, Total=1122 [2024-11-28 02:40:16,671 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 31 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 27 states have internal predecessors, (53), 4 states have call successors, (4), 2 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 02:40:17,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:40:17,650 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2024-11-28 02:40:17,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 02:40:17,651 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 27 states have internal predecessors, (53), 4 states have call successors, (4), 2 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 39 [2024-11-28 02:40:17,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:40:17,653 INFO L225 Difference]: With dead ends: 57 [2024-11-28 02:40:17,654 INFO L226 Difference]: Without dead ends: 46 [2024-11-28 02:40:17,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=135, Invalid=1511, Unknown=2, NotChecked=158, Total=1806 [2024-11-28 02:40:17,656 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:40:17,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 302 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 602 Invalid, 0 Unknown, 45 Unchecked, 0.6s Time] [2024-11-28 02:40:17,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-28 02:40:17,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2024-11-28 02:40:17,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 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 02:40:17,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-11-28 02:40:17,674 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 39 [2024-11-28 02:40:17,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:40:17,676 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-11-28 02:40:17,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 27 states have internal predecessors, (53), 4 states have call successors, (4), 2 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 02:40:17,677 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-11-28 02:40:17,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-28 02:40:17,678 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:40:17,678 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:40:17,691 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 02:40:17,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:40:17,879 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:40:17,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:40:17,879 INFO L85 PathProgramCache]: Analyzing trace with hash -946470603, now seen corresponding path program 1 times [2024-11-28 02:40:17,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:40:17,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559057815] [2024-11-28 02:40:17,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:40:17,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:40:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:40:19,713 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:40:19,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:40:19,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559057815] [2024-11-28 02:40:19,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559057815] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:40:19,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326364243] [2024-11-28 02:40:19,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:40:19,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:40:19,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:40:19,719 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:40:19,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 02:40:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:40:20,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-11-28 02:40:20,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:40:20,576 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 02:40:20,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 02:40:20,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 02:40:21,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-28 02:40:21,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-28 02:40:21,261 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 02:40:21,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-28 02:40:21,473 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 02:40:21,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-28 02:40:21,502 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 02:40:21,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-28 02:40:22,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2024-11-28 02:40:22,173 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:40:22,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 47 [2024-11-28 02:40:22,693 INFO L349 Elim1Store]: treesize reduction 118, result has 31.4 percent of original size [2024-11-28 02:40:22,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 85 treesize of output 103 [2024-11-28 02:40:23,107 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 71 treesize of output 59 [2024-11-28 02:40:23,408 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 02:40:23,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:40:24,099 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 602 treesize of output 546 [2024-11-28 02:40:24,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:40:24,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 237 treesize of output 219 [2024-11-28 02:40:24,865 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 02:40:25,005 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 02:40:25,115 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 02:40:25,160 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse22 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse1 (+ .cse22 4)) (.cse6 (= .cse22 0))) (let ((.cse9 (not .cse6)) (.cse13 (= .cse1 0)) (.cse10 (= .cse0 0)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((|v_node_create_~temp~0#1.base_56| Int)) (or (forall ((v_ArrVal_797 Int) (v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_25| Int) (v_ArrVal_806 (Array Int Int)) (v_DerPreprocessor_1 Int) (v_arrayElimCell_34 Int)) (let ((.cse2 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_56| v_arrayElimArr_4)) (.cse3 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_25| 4))) (or (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_25| (select (select (store |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_56| v_ArrVal_806) .cse0) .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse2 v_arrayElimCell_34 (store (select .cse2 v_arrayElimCell_34) .cse3 v_ArrVal_797)) .cse4) .cse5)) (not (= (select v_arrayElimArr_4 0) |c_ULTIMATE.start_sll_append_~data#1|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse2 v_DerPreprocessor_1 (store (select .cse2 v_DerPreprocessor_1) .cse3 v_ArrVal_797)) .cse4) .cse5))))) (= .cse0 |v_node_create_~temp~0#1.base_56|) (= |v_node_create_~temp~0#1.base_56| 0))) (or (and (or .cse6 (forall ((v_ArrVal_797 Int) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_806 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_25| Int) (|v_node_create_~temp~0#1.base_56| Int) (v_arrayElimCell_34 Int)) (or (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_25| (select (select (store |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_56| v_ArrVal_806) .cse0) .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse7 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_56| v_arrayElimArr_4))) (store .cse7 v_arrayElimCell_34 (store (select .cse7 v_arrayElimCell_34) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_25| 4) v_ArrVal_797))) .cse4) .cse5)) (not (= (select v_arrayElimArr_4 0) |c_ULTIMATE.start_sll_append_~data#1|)) (= |v_node_create_~temp~0#1.base_56| 0)))) (or (forall ((v_ArrVal_797 Int) (v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_25| Int)) (or (not (= (select v_arrayElimArr_4 0) |c_ULTIMATE.start_sll_append_~data#1|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse8 (store |c_#memory_int#2| .cse0 v_arrayElimArr_4))) (store .cse8 0 (store (select .cse8 0) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_25| 4) v_ArrVal_797))) .cse4) .cse5)))) .cse9 .cse10) (forall ((|v_node_create_~temp~0#1.base_56| Int)) (or (forall ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_25| Int) (v_ArrVal_806 (Array Int Int))) (or (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((v_ArrVal_797 Int) (v_arrayElimCell_34 Int)) (let ((.cse11 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_56| v_arrayElimArr_4)) (.cse12 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_25| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse11 v_arrayElimCell_34 (store (select .cse11 v_arrayElimCell_34) .cse12 v_ArrVal_797)) .cse4) .cse5)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse11 0 (store (select .cse11 0) .cse12 v_ArrVal_797)) .cse4) .cse5))))) (not (= (select v_arrayElimArr_4 0) |c_ULTIMATE.start_sll_append_~data#1|)))) (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_25| (select (select (store |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_56| v_ArrVal_806) .cse0) .cse1)))) (= |v_node_create_~temp~0#1.base_56| 0)))) .cse13) (forall ((|v_node_create_~temp~0#1.base_56| Int)) (or (forall ((v_ArrVal_797 Int) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_806 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_25| Int) (v_arrayElimCell_34 Int)) (or (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_25| (select (select (store |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_56| v_ArrVal_806) .cse0) .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse14 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_56| v_arrayElimArr_4))) (store .cse14 v_arrayElimCell_34 (store (select .cse14 v_arrayElimCell_34) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_25| 4) v_ArrVal_797))) .cse4) .cse5)) (not (= (select v_arrayElimArr_4 0) |c_ULTIMATE.start_sll_append_~data#1|)))) (= .cse0 |v_node_create_~temp~0#1.base_56|) (= |v_node_create_~temp~0#1.base_56| 0))) (or .cse9 (forall ((v_ArrVal_797 Int) (v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_25| Int) (v_DerPreprocessor_1 Int)) (let ((.cse15 (store |c_#memory_int#2| .cse0 v_arrayElimArr_4)) (.cse16 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_25| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse15 v_DerPreprocessor_1 (store (select .cse15 v_DerPreprocessor_1) .cse16 v_ArrVal_797)) .cse4) .cse5)) (not (= (select v_arrayElimArr_4 0) |c_ULTIMATE.start_sll_append_~data#1|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse15 0 (store (select .cse15 0) .cse16 v_ArrVal_797)) .cse4) .cse5))))) .cse10) (or .cse6 (forall ((v_ArrVal_797 Int) (v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_25| Int) (v_ArrVal_806 (Array Int Int)) (|v_node_create_~temp~0#1.base_56| Int) (v_DerPreprocessor_1 Int) (v_arrayElimCell_34 Int)) (let ((.cse17 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_56| v_arrayElimArr_4)) (.cse18 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_25| 4))) (or (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_25| (select (select (store |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_56| v_ArrVal_806) .cse0) .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse17 v_arrayElimCell_34 (store (select .cse17 v_arrayElimCell_34) .cse18 v_ArrVal_797)) .cse4) .cse5)) (not (= (select v_arrayElimArr_4 0) |c_ULTIMATE.start_sll_append_~data#1|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse17 v_DerPreprocessor_1 (store (select .cse17 v_DerPreprocessor_1) .cse18 v_ArrVal_797)) .cse4) .cse5)) (= |v_node_create_~temp~0#1.base_56| 0))))) (or (not .cse13) .cse10 (forall ((v_ArrVal_797 Int) (v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_25| Int) (v_DerPreprocessor_1 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse19 (store |c_#memory_int#2| .cse0 v_arrayElimArr_4))) (store .cse19 v_DerPreprocessor_1 (store (select .cse19 v_DerPreprocessor_1) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_25| 4) v_ArrVal_797))) .cse4) .cse5)) (not (= (select v_arrayElimArr_4 0) |c_ULTIMATE.start_sll_append_~data#1|))))) (forall ((|v_node_create_~temp~0#1.base_56| Int)) (or (forall ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_25| Int) (v_ArrVal_806 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_25| (select (select (store |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_56| v_ArrVal_806) .cse0) .cse1)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 0) |c_ULTIMATE.start_sll_append_~data#1|)) (forall ((v_ArrVal_797 Int) (v_DerPreprocessor_1 Int) (v_arrayElimCell_34 Int)) (let ((.cse20 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_56| v_arrayElimArr_4)) (.cse21 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_25| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse20 v_arrayElimCell_34 (store (select .cse20 v_arrayElimCell_34) .cse21 v_ArrVal_797)) .cse4) .cse5)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse20 v_DerPreprocessor_1 (store (select .cse20 v_DerPreprocessor_1) .cse21 v_ArrVal_797)) .cse4) .cse5)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse20 0 (store (select .cse20 0) .cse21 v_ArrVal_797)) .cse4) .cse5))))))))) (= |v_node_create_~temp~0#1.base_56| 0))))))) is different from false [2024-11-28 02:40:25,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326364243] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:40:25,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:40:25,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 43 [2024-11-28 02:40:25,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809407189] [2024-11-28 02:40:25,196 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:40:25,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-28 02:40:25,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:40:25,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-28 02:40:25,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1934, Unknown=1, NotChecked=88, Total=2162 [2024-11-28 02:40:25,203 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 43 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 36 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 02:40:29,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 02:40:38,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 02:40:38,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:40:38,668 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2024-11-28 02:40:38,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-28 02:40:38,669 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 36 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2024-11-28 02:40:38,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:40:38,671 INFO L225 Difference]: With dead ends: 60 [2024-11-28 02:40:38,671 INFO L226 Difference]: Without dead ends: 58 [2024-11-28 02:40:38,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=261, Invalid=3523, Unknown=2, NotChecked=120, Total=3906 [2024-11-28 02:40:38,673 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 38 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:40:38,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 467 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 880 Invalid, 1 Unknown, 0 Unchecked, 8.0s Time] [2024-11-28 02:40:38,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-28 02:40:38,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2024-11-28 02:40:38,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 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 02:40:38,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2024-11-28 02:40:38,688 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 40 [2024-11-28 02:40:38,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:40:38,688 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-11-28 02:40:38,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 36 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 02:40:38,689 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2024-11-28 02:40:38,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-28 02:40:38,690 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:40:38,690 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1] [2024-11-28 02:40:38,698 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 02:40:38,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:40:38,891 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:40:38,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:40:38,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1890858921, now seen corresponding path program 2 times [2024-11-28 02:40:38,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:40:38,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374955407] [2024-11-28 02:40:38,892 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:40:38,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:40:38,954 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:40:38,955 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:40:42,017 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:40:42,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:40:42,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374955407] [2024-11-28 02:40:42,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374955407] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:40:42,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529758979] [2024-11-28 02:40:42,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:40:42,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:40:42,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:40:42,022 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:40:42,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 02:40:42,241 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:40:42,241 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:40:42,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-11-28 02:40:42,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:40:42,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:40:42,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 02:40:42,538 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 02:40:42,684 WARN L851 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) 1) (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) 0) (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| |c_#memory_$Pointer$#2.offset|))) (and (= .cse1 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) 0) (= (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1)) |c_#memory_$Pointer$#2.offset|)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)) is different from false [2024-11-28 02:40:42,690 WARN L873 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) 1) (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) 0) (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| |c_#memory_$Pointer$#2.offset|))) (and (= .cse1 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) 0) (= (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1)) |c_#memory_$Pointer$#2.offset|)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)) is different from true [2024-11-28 02:40:42,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 02:40:42,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 02:40:42,791 INFO L349 Elim1Store]: treesize reduction 55, result has 23.6 percent of original size [2024-11-28 02:40:42,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 21 [2024-11-28 02:40:42,805 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse2 (+ 4 .cse3))) (or (exists ((|v_#memory_$Pointer$#2.offset_73| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| |v_#memory_$Pointer$#2.offset_73|))) (and (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse0) (= |v_#memory_$Pointer$#2.offset_73| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| .cse0 (select |v_#memory_$Pointer$#2.offset_73| .cse0))) (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| .cse1) .cse2) 0)))) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_73| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_73| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 .cse3))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) .cse2) 0)))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |c_#valid| .cse4)))) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2024-11-28 02:40:42,809 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse2 (+ 4 .cse3))) (or (exists ((|v_#memory_$Pointer$#2.offset_73| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| |v_#memory_$Pointer$#2.offset_73|))) (and (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse0) (= |v_#memory_$Pointer$#2.offset_73| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| .cse0 (select |v_#memory_$Pointer$#2.offset_73| .cse0))) (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| .cse1) .cse2) 0)))) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_73| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_73| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 .cse3))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) .cse2) 0)))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |c_#valid| .cse4)))) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2024-11-28 02:40:42,937 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (let ((.cse2 (+ .cse0 4))) (or (exists ((|v_#memory_$Pointer$#2.offset_73| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$#2.offset_73| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$#2.offset_73| |c_ULTIMATE.start_sll_create_#res#1.base|) 4 .cse0)) |c_#memory_$Pointer$#2.offset|) (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| |v_#memory_$Pointer$#2.offset_73|))) (and (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| .cse1) .cse2) 0) (= |v_#memory_$Pointer$#2.offset_73| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| .cse3 (select |v_#memory_$Pointer$#2.offset_73| .cse3))) (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse3)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) .cse2) 0)))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |c_#valid| .cse4)))))))) is different from false [2024-11-28 02:40:42,942 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (let ((.cse2 (+ .cse0 4))) (or (exists ((|v_#memory_$Pointer$#2.offset_73| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$#2.offset_73| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$#2.offset_73| |c_ULTIMATE.start_sll_create_#res#1.base|) 4 .cse0)) |c_#memory_$Pointer$#2.offset|) (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| |v_#memory_$Pointer$#2.offset_73|))) (and (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| .cse1) .cse2) 0) (= |v_#memory_$Pointer$#2.offset_73| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| .cse3 (select |v_#memory_$Pointer$#2.offset_73| .cse3))) (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse3)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) .cse2) 0)))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |c_#valid| .cse4)))))))) is different from true [2024-11-28 02:40:43,020 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0))) (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4))) (let ((.cse4 (+ .cse5 4))) (or (exists ((|v_#memory_$Pointer$#2.offset_73| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| |v_#memory_$Pointer$#2.offset_73|))) (and (= .cse0 .cse3) (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| .cse2) .cse4) 0) (= |v_#memory_$Pointer$#2.offset_73| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| .cse3 (select |v_#memory_$Pointer$#2.offset_73| .cse3)))))) (= (store |v_#memory_$Pointer$#2.offset_73| .cse0 (store (select |v_#memory_$Pointer$#2.offset_73| .cse0) 4 .cse5)) |c_#memory_$Pointer$#2.offset|))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse4) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2024-11-28 02:40:43,025 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0))) (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4))) (let ((.cse4 (+ .cse5 4))) (or (exists ((|v_#memory_$Pointer$#2.offset_73| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| |v_#memory_$Pointer$#2.offset_73|))) (and (= .cse0 .cse3) (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| .cse2) .cse4) 0) (= |v_#memory_$Pointer$#2.offset_73| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| .cse3 (select |v_#memory_$Pointer$#2.offset_73| .cse3)))))) (= (store |v_#memory_$Pointer$#2.offset_73| .cse0 (store (select |v_#memory_$Pointer$#2.offset_73| .cse0) 4 .cse5)) |c_#memory_$Pointer$#2.offset|))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse4) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2024-11-28 02:40:43,057 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 114 treesize of output 90 [2024-11-28 02:40:43,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-28 02:40:43,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:40:43,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-28 02:40:43,172 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-28 02:40:43,175 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-28 02:40:43,213 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-28 02:40:43,217 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-28 02:40:43,298 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (exists ((|v_node_create_~temp~0#1.base_60| Int)) (and (= (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_60| (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_60|)) |c_#memory_int#2|) (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_60| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_60|)) |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_60|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_60| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_60|)) |c_#memory_$Pointer$#2.offset|)))) is different from false [2024-11-28 02:40:43,302 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (exists ((|v_node_create_~temp~0#1.base_60| Int)) (and (= (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_60| (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_60|)) |c_#memory_int#2|) (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_60| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_60|)) |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_60|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_60| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_60|)) |c_#memory_$Pointer$#2.offset|)))) is different from true [2024-11-28 02:40:43,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:40:43,412 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 122 treesize of output 105 [2024-11-28 02:40:43,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:40:43,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-28 02:40:43,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:40:43,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:40:43,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:40:43,468 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 34 treesize of output 32 [2024-11-28 02:40:43,565 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (exists ((|v_node_create_~temp~0#1.base_60| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_60|)) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0))) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) (+ (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 4)) 0) (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2024-11-28 02:40:43,572 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (exists ((|v_node_create_~temp~0#1.base_60| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_60|)) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0))) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) (+ (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 4)) 0) (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2024-11-28 02:40:43,821 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (exists ((|v_node_create_~temp~0#1.base_60| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_60|)) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) (+ (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 4)) 0) (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2024-11-28 02:40:43,827 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (exists ((|v_node_create_~temp~0#1.base_60| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_60|)) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) (+ (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 4)) 0) (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2024-11-28 02:40:44,033 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 26 [2024-11-28 02:40:44,127 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1)))) (= (select (select |c_#memory_int#2| .cse2) 0) 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse3) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_node_create_~temp~0#1.base_60| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_60|)) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_8| .cse4))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 1))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ .cse3 4)) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2024-11-28 02:40:44,133 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1)))) (= (select (select |c_#memory_int#2| .cse2) 0) 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse3) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_node_create_~temp~0#1.base_60| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_60|)) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_8| .cse4))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 1))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ .cse3 4)) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2024-11-28 02:40:44,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:40:44,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-28 02:40:44,411 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1)))) (= (select (select |c_#memory_int#2| .cse2) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_node_create_~temp~0#1.base_60| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.base_28| Int)) (and (= 0 (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_60|)) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_append_~last~0#1.base_28|) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) is different from false [2024-11-28 02:40:44,416 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1)))) (= (select (select |c_#memory_int#2| .cse2) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_node_create_~temp~0#1.base_60| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.base_28| Int)) (and (= 0 (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_60|)) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_append_~last~0#1.base_28|) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) is different from true [2024-11-28 02:40:44,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-28 02:40:44,613 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1)))) (= (select (select |c_#memory_int#2| .cse2) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_node_create_~temp~0#1.base_60| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.base_28| Int)) (and (= 0 (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_60|)) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_append_~last~0#1.base_28|) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) is different from false [2024-11-28 02:40:44,617 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1)))) (= (select (select |c_#memory_int#2| .cse2) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_node_create_~temp~0#1.base_60| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.base_28| Int)) (and (= 0 (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_60|)) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_append_~last~0#1.base_28|) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) is different from true [2024-11-28 02:40:44,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:40:44,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 39 [2024-11-28 02:40:44,684 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 02:40:44,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 02:40:44,694 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_node_create_~temp~0#1.base_60| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.base_28| Int)) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 0 (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_60|)) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_append_~last~0#1.base_28|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1)) is different from false [2024-11-28 02:40:44,696 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_node_create_~temp~0#1.base_60| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.base_28| Int)) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 0 (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_60|)) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_append_~last~0#1.base_28|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1)) is different from true [2024-11-28 02:40:44,771 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 19 not checked. [2024-11-28 02:40:44,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:40:45,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529758979] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:40:45,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:40:45,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 45 [2024-11-28 02:40:45,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143782485] [2024-11-28 02:40:45,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:40:45,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-28 02:40:45,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:40:45,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-28 02:40:45,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1212, Unknown=26, NotChecked=1066, Total=2450 [2024-11-28 02:40:45,579 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 45 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 38 states have internal predecessors, (68), 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 02:40:46,199 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0)) (.cse1 (= (select .cse5 .cse3) 0))) (and (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= .cse0 1) (or .cse1 (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| |c_#memory_$Pointer$#2.offset|))) (and (= .cse2 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3) 0) (= (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| .cse2 (select |c_#memory_$Pointer$#2.offset| .cse2)) |c_#memory_$Pointer$#2.offset|))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_create_~data#1|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |c_#valid| .cse4)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= (select .cse5 4) 0) .cse1 (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~data#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)))) is different from false [2024-11-28 02:40:46,204 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0)) (.cse1 (= (select .cse5 .cse3) 0))) (and (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= .cse0 1) (or .cse1 (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| |c_#memory_$Pointer$#2.offset|))) (and (= .cse2 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3) 0) (= (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| .cse2 (select |c_#memory_$Pointer$#2.offset| .cse2)) |c_#memory_$Pointer$#2.offset|))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_create_~data#1|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |c_#valid| .cse4)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= (select .cse5 4) 0) .cse1 (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~data#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)))) is different from true [2024-11-28 02:40:46,211 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (.cse6 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0)) (.cse4 (select .cse6 4)) (.cse5 (select |c_#memory_$Pointer$#2.offset| .cse2))) (and (= .cse0 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse3 (+ 4 .cse4))) (or (exists ((|v_#memory_$Pointer$#2.offset_73| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| |v_#memory_$Pointer$#2.offset_73|))) (and (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) (= |v_#memory_$Pointer$#2.offset_73| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| .cse1 (select |v_#memory_$Pointer$#2.offset_73| .cse1))) (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| .cse2) .cse3) 0)))) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_73| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_73| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 .cse4))))) (= (select .cse5 .cse3) 0))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_create_~data#1|) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= .cse4 0) (= (select |c_#valid| .cse2) 1) (= (select .cse6 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) (= (select .cse5 4) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse7 (select |c_#valid| .cse7)))) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1))) (= |c_ULTIMATE.start_sll_create_~data#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from false [2024-11-28 02:40:46,216 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (.cse6 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0)) (.cse4 (select .cse6 4)) (.cse5 (select |c_#memory_$Pointer$#2.offset| .cse2))) (and (= .cse0 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse3 (+ 4 .cse4))) (or (exists ((|v_#memory_$Pointer$#2.offset_73| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| |v_#memory_$Pointer$#2.offset_73|))) (and (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) (= |v_#memory_$Pointer$#2.offset_73| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| .cse1 (select |v_#memory_$Pointer$#2.offset_73| .cse1))) (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| .cse2) .cse3) 0)))) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_73| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_73| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 .cse4))))) (= (select .cse5 .cse3) 0))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_create_~data#1|) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= .cse4 0) (= (select |c_#valid| .cse2) 1) (= (select .cse6 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) (= (select .cse5 4) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse7 (select |c_#valid| .cse7)))) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1))) (= |c_ULTIMATE.start_sll_create_~data#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from true [2024-11-28 02:40:46,225 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (.cse5 (select |c_#memory_$Pointer$#2.offset| .cse2))) (and (= .cse0 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse3 (+ 4 .cse4))) (or (exists ((|v_#memory_$Pointer$#2.offset_73| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| |v_#memory_$Pointer$#2.offset_73|))) (and (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) (= |v_#memory_$Pointer$#2.offset_73| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| .cse1 (select |v_#memory_$Pointer$#2.offset_73| .cse1))) (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| .cse2) .cse3) 0)))) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_73| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_73| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 .cse4))))) (= (select .cse5 .cse3) 0))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= .cse4 0) (= (select |c_#valid| .cse2) 1) (= (select .cse5 4) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse6 (select |c_#valid| .cse6)))) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from false [2024-11-28 02:40:46,229 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (.cse5 (select |c_#memory_$Pointer$#2.offset| .cse2))) (and (= .cse0 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse3 (+ 4 .cse4))) (or (exists ((|v_#memory_$Pointer$#2.offset_73| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| |v_#memory_$Pointer$#2.offset_73|))) (and (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) (= |v_#memory_$Pointer$#2.offset_73| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| .cse1 (select |v_#memory_$Pointer$#2.offset_73| .cse1))) (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| .cse2) .cse3) 0)))) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_73| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_73| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 .cse4))))) (= (select .cse5 .cse3) 0))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= .cse4 0) (= (select |c_#valid| .cse2) 1) (= (select .cse5 4) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse6 (select |c_#valid| .cse6)))) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from true [2024-11-28 02:40:46,235 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (.cse2 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_#res#1.base|) 0)) (.cse5 (select |c_#memory_$Pointer$#2.offset| .cse1))) (and (= .cse0 0) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= .cse2 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse3 (+ .cse0 4))) (or (exists ((|v_#memory_$Pointer$#2.offset_73| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$#2.offset_73| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$#2.offset_73| |c_ULTIMATE.start_sll_create_#res#1.base|) 4 .cse0)) |c_#memory_$Pointer$#2.offset|) (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| |v_#memory_$Pointer$#2.offset_73|))) (and (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| .cse1) .cse3) 0) (= |v_#memory_$Pointer$#2.offset_73| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| .cse4 (select |v_#memory_$Pointer$#2.offset_73| .cse4))) (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse4)))))) (= (select .cse5 .cse3) 0))) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= |c_#valid| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse6 (select |c_#valid| .cse6)))))) (= (select .cse5 4) 0)))) is different from false [2024-11-28 02:40:46,239 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (.cse2 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_#res#1.base|) 0)) (.cse5 (select |c_#memory_$Pointer$#2.offset| .cse1))) (and (= .cse0 0) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= .cse2 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse3 (+ .cse0 4))) (or (exists ((|v_#memory_$Pointer$#2.offset_73| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$#2.offset_73| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$#2.offset_73| |c_ULTIMATE.start_sll_create_#res#1.base|) 4 .cse0)) |c_#memory_$Pointer$#2.offset|) (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| |v_#memory_$Pointer$#2.offset_73|))) (and (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| .cse1) .cse3) 0) (= |v_#memory_$Pointer$#2.offset_73| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| .cse4 (select |v_#memory_$Pointer$#2.offset_73| .cse4))) (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse4)))))) (= (select .cse5 .cse3) 0))) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= |c_#valid| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse6 (select |c_#valid| .cse6)))))) (= (select .cse5 4) 0)))) is different from true [2024-11-28 02:40:46,247 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse10 0)) (.cse5 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse5) 0)) (= (select |c_#valid| .cse3) 1) (= (select |c_#valid| .cse4) 1) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4))) (let ((.cse7 (+ .cse8 4))) (or (exists ((|v_#memory_$Pointer$#2.offset_73| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| |v_#memory_$Pointer$#2.offset_73|))) (and (= .cse0 .cse6) (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| .cse2) .cse7) 0) (= |v_#memory_$Pointer$#2.offset_73| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| .cse6 (select |v_#memory_$Pointer$#2.offset_73| .cse6)))))) (= (store |v_#memory_$Pointer$#2.offset_73| .cse0 (store (select |v_#memory_$Pointer$#2.offset_73| .cse0) 4 .cse8)) |c_#memory_$Pointer$#2.offset|))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse7) 0)))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse9 0) 0) (= (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-11-28 02:40:46,251 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse10 0)) (.cse5 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse5) 0)) (= (select |c_#valid| .cse3) 1) (= (select |c_#valid| .cse4) 1) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4))) (let ((.cse7 (+ .cse8 4))) (or (exists ((|v_#memory_$Pointer$#2.offset_73| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| |v_#memory_$Pointer$#2.offset_73|))) (and (= .cse0 .cse6) (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| .cse2) .cse7) 0) (= |v_#memory_$Pointer$#2.offset_73| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_19| .cse6 (select |v_#memory_$Pointer$#2.offset_73| .cse6)))))) (= (store |v_#memory_$Pointer$#2.offset_73| .cse0 (store (select |v_#memory_$Pointer$#2.offset_73| .cse0) 4 .cse8)) |c_#memory_$Pointer$#2.offset|))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse7) 0)))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse9 0) 0) (= (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-11-28 02:40:46,257 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-28 02:40:46,260 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-28 02:40:46,269 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (@diff |c_old(#memory_int#2)| |c_#memory_int#2|))) (let ((.cse0 (store |c_old(#memory_int#2)| .cse6 (select |c_#memory_int#2| .cse6)))) (let ((.cse2 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse1 (@diff .cse0 |c_#memory_int#2|)) (.cse5 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_#memory_int#2| (store .cse0 .cse1 (select |c_#memory_int#2| .cse1))) (= |c_node_create_#res#1.offset| 0) (or (= (select |c_old(#valid)| .cse2) 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse2 (select |c_#memory_$Pointer$#2.offset| .cse2)) |c_#memory_$Pointer$#2.offset|) (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))))))) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse5) 0)) (or (= .cse0 |c_#memory_int#2|) (= (select |c_old(#valid)| .cse1) 0)) (= (store |c_old(#memory_$Pointer$#2.base)| .cse5 (select |c_#memory_$Pointer$#2.base| .cse5)) |c_#memory_$Pointer$#2.base|) (exists ((|v_node_create_~temp~0#1.base_60| Int)) (and (= (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_60| (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_60|)) |c_#memory_int#2|) (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_60| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_60|)) |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_60|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_60| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_60|)) |c_#memory_$Pointer$#2.offset|))) (or (= (select |c_old(#valid)| .cse6) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|)))))) is different from false [2024-11-28 02:40:46,275 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (@diff |c_old(#memory_int#2)| |c_#memory_int#2|))) (let ((.cse0 (store |c_old(#memory_int#2)| .cse6 (select |c_#memory_int#2| .cse6)))) (let ((.cse2 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse1 (@diff .cse0 |c_#memory_int#2|)) (.cse5 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_#memory_int#2| (store .cse0 .cse1 (select |c_#memory_int#2| .cse1))) (= |c_node_create_#res#1.offset| 0) (or (= (select |c_old(#valid)| .cse2) 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse2 (select |c_#memory_$Pointer$#2.offset| .cse2)) |c_#memory_$Pointer$#2.offset|) (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))))))) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse5) 0)) (or (= .cse0 |c_#memory_int#2|) (= (select |c_old(#valid)| .cse1) 0)) (= (store |c_old(#memory_$Pointer$#2.base)| .cse5 (select |c_#memory_$Pointer$#2.base| .cse5)) |c_#memory_$Pointer$#2.base|) (exists ((|v_node_create_~temp~0#1.base_60| Int)) (and (= (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_60| (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_60|)) |c_#memory_int#2|) (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_60| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_60|)) |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_60|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_60| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_60|)) |c_#memory_$Pointer$#2.offset|))) (or (= (select |c_old(#valid)| .cse6) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|)))))) is different from true [2024-11-28 02:40:46,287 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse7 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_node_create_~temp~0#1.base_60| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_60|)) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0))) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) (+ (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 4)) 0) (= (select (select |c_#memory_$Pointer$#2.offset| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) 4) 0) (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse5) 0)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse6 0) 0) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-11-28 02:40:46,291 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse7 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_node_create_~temp~0#1.base_60| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_60|)) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0))) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) (+ (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 4)) 0) (= (select (select |c_#memory_$Pointer$#2.offset| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) 4) 0) (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse5) 0)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse6 0) 0) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-11-28 02:40:46,306 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse7 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse3 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_node_create_~temp~0#1.base_60| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_60|)) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse5) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) (+ (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 4)) 0) (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse3) 0)) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse6 0) 0) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-11-28 02:40:46,311 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse7 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse3 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_node_create_~temp~0#1.base_60| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_60|)) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse5) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) (+ (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 4)) 0) (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse3) 0)) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse6 0) 0) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-11-28 02:40:46,332 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse7 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse3 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_node_create_~temp~0#1.base_60| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_60|)) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse5) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) (+ (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 4)) 0) (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse3) 0)) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse6 0) 0) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-11-28 02:40:46,338 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse7 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse3 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_node_create_~temp~0#1.base_60| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_60|)) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse5) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) (+ (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 4)) 0) (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse3) 0)) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse6 0) 0) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-11-28 02:40:46,353 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse5 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select .cse0 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= (select (select |c_#memory_int#2| .cse3) 0) 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse4) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 0)) (exists ((|v_node_create_~temp~0#1.base_60| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_60|)) (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse6 (select |v_#valid_BEFORE_CALL_8| .cse6))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse0 (+ .cse4 4)) 0) (= (select .cse7 0) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-11-28 02:40:46,356 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse5 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select .cse0 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= (select (select |c_#memory_int#2| .cse3) 0) 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse4) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 0)) (exists ((|v_node_create_~temp~0#1.base_60| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_60|)) (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse6 (select |v_#valid_BEFORE_CALL_8| .cse6))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse0 (+ .cse4 4)) 0) (= (select .cse7 0) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-11-28 02:40:46,365 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse5 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select .cse0 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= (select (select |c_#memory_int#2| .cse3) 0) 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse4) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 0)) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_60| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_60|)) (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse6 (select |v_#valid_BEFORE_CALL_8| .cse6))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse0 (+ .cse4 4)) 0) (= (select .cse7 0) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-11-28 02:40:46,369 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse5 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select .cse0 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= (select (select |c_#memory_int#2| .cse3) 0) 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse4) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 0)) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_60| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_60|)) (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse6 (select |v_#valid_BEFORE_CALL_8| .cse6))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse0 (+ .cse4 4)) 0) (= (select .cse7 0) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-11-28 02:40:46,378 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select .cse5 0)) (.cse3 (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse2 (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (and (not .cse0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse1) .cse2))) (and .cse0 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse2)) (not (= .cse2 4)) .cse3)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_#valid_BEFORE_CALL_7| .cse6))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse7) 1)))) (= (select (select |c_#memory_int#2| .cse8) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_node_create_~temp~0#1.base_60| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.base_28| Int)) (and (= 0 (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_60|)) (= (select |v_#valid_BEFORE_CALL_8| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_append_~last~0#1.base_28|) 1) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse9 (select |v_#valid_BEFORE_CALL_8| .cse9))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse8) 0))) .cse3 (= (select .cse4 0) 0)))) is different from false [2024-11-28 02:40:46,382 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select .cse5 0)) (.cse3 (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse2 (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (and (not .cse0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse1) .cse2))) (and .cse0 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse2)) (not (= .cse2 4)) .cse3)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_#valid_BEFORE_CALL_7| .cse6))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse7) 1)))) (= (select (select |c_#memory_int#2| .cse8) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_node_create_~temp~0#1.base_60| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.base_28| Int)) (and (= 0 (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_60|)) (= (select |v_#valid_BEFORE_CALL_8| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_append_~last~0#1.base_28|) 1) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse9 (select |v_#valid_BEFORE_CALL_8| .cse9))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse8) 0))) .cse3 (= (select .cse4 0) 0)))) is different from true [2024-11-28 02:40:46,441 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse5 0)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1)))) (= (select (select |c_#memory_int#2| .cse2) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_node_create_~temp~0#1.base_60| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.base_28| Int)) (and (= 0 (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_60|)) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_append_~last~0#1.base_28|) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0))) (= (select .cse4 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2024-11-28 02:40:46,445 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse5 0)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_40 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_40) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1)))) (= (select (select |c_#memory_int#2| .cse2) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_node_create_~temp~0#1.base_60| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.base_28| Int)) (and (= 0 (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_60|)) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_append_~last~0#1.base_28|) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0))) (= (select .cse4 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from true [2024-11-28 02:40:46,471 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_node_create_~temp~0#1.base_60| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.base_28| Int)) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 0 (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_60|)) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_append_~last~0#1.base_28|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|))) (= (select .cse0 0) 1))) is different from false [2024-11-28 02:40:46,474 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_node_create_~temp~0#1.base_60| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.base_28| Int)) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 0 (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_60|)) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_append_~last~0#1.base_28|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|))) (= (select .cse0 0) 1))) is different from true [2024-11-28 02:40:46,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:40:46,528 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2024-11-28 02:40:46,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-28 02:40:46,529 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 38 states have internal predecessors, (68), 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 43 [2024-11-28 02:40:46,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:40:46,530 INFO L225 Difference]: With dead ends: 59 [2024-11-28 02:40:46,530 INFO L226 Difference]: Without dead ends: 57 [2024-11-28 02:40:46,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 28 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=201, Invalid=1495, Unknown=56, NotChecked=2940, Total=4692 [2024-11-28 02:40:46,531 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 1769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1478 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:40:46,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 310 Invalid, 1769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 286 Invalid, 0 Unknown, 1478 Unchecked, 0.4s Time] [2024-11-28 02:40:46,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-28 02:40:46,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2024-11-28 02:40:46,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 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 02:40:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2024-11-28 02:40:46,546 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 43 [2024-11-28 02:40:46,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:40:46,546 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2024-11-28 02:40:46,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 38 states have internal predecessors, (68), 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 02:40:46,547 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2024-11-28 02:40:46,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-28 02:40:46,547 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:40:46,547 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-28 02:40:46,555 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 02:40:46,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-28 02:40:46,748 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:40:46,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:40:46,749 INFO L85 PathProgramCache]: Analyzing trace with hash 155480957, now seen corresponding path program 1 times [2024-11-28 02:40:46,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:40:46,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609283341] [2024-11-28 02:40:46,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:40:46,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:40:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:40:50,280 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:40:50,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:40:50,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609283341] [2024-11-28 02:40:50,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609283341] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:40:50,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585210011] [2024-11-28 02:40:50,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:40:50,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:40:50,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:40:50,283 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:40:50,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 02:40:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:40:50,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 139 conjuncts are in the unsatisfiable core [2024-11-28 02:40:50,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:40:50,678 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 02:40:50,777 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 02:40:50,960 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 02:40:51,229 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (exists ((|v_#memory_int#2_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#2_BEFORE_CALL_8| |c_#memory_int#2|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_8| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= (store |v_#memory_int#2_BEFORE_CALL_8| .cse1 (select |c_#memory_int#2| .cse1)) |c_#memory_int#2|) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse1))))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)) is different from false [2024-11-28 02:40:51,236 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (exists ((|v_#memory_int#2_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#2_BEFORE_CALL_8| |c_#memory_int#2|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_8| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= (store |v_#memory_int#2_BEFORE_CALL_8| .cse1 (select |c_#memory_int#2| .cse1)) |c_#memory_int#2|) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse1))))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)) is different from true [2024-11-28 02:40:51,275 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 02:40:51,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 02:40:51,326 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 02:40:51,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-28 02:40:51,352 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_int#2| .cse0) 0) 1)) (not (= .cse0 0)) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2024-11-28 02:40:51,355 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_int#2| .cse0) 0) 1)) (not (= .cse0 0)) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2024-11-28 02:40:51,447 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse0)) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1)))))))) is different from false [2024-11-28 02:40:51,450 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse0)) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1)))))))) is different from true [2024-11-28 02:40:51,503 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= (select |c_#valid| .cse0) 1) (not (= .cse1 0)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 .cse0) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2024-11-28 02:40:51,506 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= (select |c_#valid| .cse0) 1) (not (= .cse1 0)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 .cse0) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2024-11-28 02:40:51,525 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 57 treesize of output 25 [2024-11-28 02:40:51,532 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 15 treesize of output 11 [2024-11-28 02:40:51,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-28 02:40:51,572 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_12| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-28 02:40:51,574 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_12| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-28 02:40:51,616 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_12| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (<= 0 |c_node_create_~temp~0#1.offset|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-28 02:40:51,619 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_12| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (<= 0 |c_node_create_~temp~0#1.offset|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-28 02:40:51,737 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_12| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (exists ((|v_node_create_~temp~0#1.base_69| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_69| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_69|)) |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_69|) 0) (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_69| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_69|))) (= (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_69| (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_69|)) |c_#memory_int#2|))) (<= 0 |c_node_create_#res#1.offset|)) is different from false [2024-11-28 02:40:51,741 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_12| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (exists ((|v_node_create_~temp~0#1.base_69| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_69| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_69|)) |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_69|) 0) (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_69| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_69|))) (= (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_69| (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_69|)) |c_#memory_int#2|))) (<= 0 |c_node_create_#res#1.offset|)) is different from true [2024-11-28 02:40:51,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:40:51,864 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 65 treesize of output 42 [2024-11-28 02:40:51,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:40:51,878 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 40 treesize of output 35 [2024-11-28 02:40:51,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:40:51,895 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 02:40:51,942 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1))) (not (= .cse2 0)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse3) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse4 (select |v_#valid_BEFORE_CALL_12| .cse4)))) (= (select |v_#valid_BEFORE_CALL_11| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (<= 0 |c_ULTIMATE.start_sll_append_#t~ret7#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2024-11-28 02:40:51,946 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1))) (not (= .cse2 0)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse3) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse4 (select |v_#valid_BEFORE_CALL_12| .cse4)))) (= (select |v_#valid_BEFORE_CALL_11| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (<= 0 |c_ULTIMATE.start_sll_append_#t~ret7#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2024-11-28 02:40:52,041 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1))) (not (= .cse2 0)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse3) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse4 (select |v_#valid_BEFORE_CALL_12| .cse4)))) (= (select |v_#valid_BEFORE_CALL_11| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 0 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|)))) is different from false [2024-11-28 02:40:52,045 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1))) (not (= .cse2 0)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse3) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse4 (select |v_#valid_BEFORE_CALL_12| .cse4)))) (= (select |v_#valid_BEFORE_CALL_11| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 0 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|)))) is different from true [2024-11-28 02:40:52,141 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1))) (not (= .cse2 0)) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse3) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse4 (select |v_#valid_BEFORE_CALL_12| .cse4)))) (= (select |v_#valid_BEFORE_CALL_11| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 0 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|)))) is different from false [2024-11-28 02:40:52,145 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1))) (not (= .cse2 0)) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse3) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse4 (select |v_#valid_BEFORE_CALL_12| .cse4)))) (= (select |v_#valid_BEFORE_CALL_11| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 0 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|)))) is different from true [2024-11-28 02:40:52,466 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1))) (<= 0 |c_ULTIMATE.start_sll_append_~last~0#1.offset|) (not (= .cse2 0)) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse3) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse4 (select |v_#valid_BEFORE_CALL_12| .cse4)))) (= (select |v_#valid_BEFORE_CALL_11| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 0 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|)))) is different from false [2024-11-28 02:40:52,472 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1))) (<= 0 |c_ULTIMATE.start_sll_append_~last~0#1.offset|) (not (= .cse2 0)) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse3) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse4 (select |v_#valid_BEFORE_CALL_12| .cse4)))) (= (select |v_#valid_BEFORE_CALL_11| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 0 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|)))) is different from true [2024-11-28 02:40:52,624 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) |c_ULTIMATE.start_sll_append_#t~mem10#1.base|) (<= 0 |c_ULTIMATE.start_sll_append_~last~0#1.offset|) (not (= .cse2 0)) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse3) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse4 (select |v_#valid_BEFORE_CALL_12| .cse4)))) (= (select |v_#valid_BEFORE_CALL_11| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 0 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|)))) is different from false [2024-11-28 02:40:52,628 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) |c_ULTIMATE.start_sll_append_#t~mem10#1.base|) (<= 0 |c_ULTIMATE.start_sll_append_~last~0#1.offset|) (not (= .cse2 0)) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse3) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse4 (select |v_#valid_BEFORE_CALL_12| .cse4)))) (= (select |v_#valid_BEFORE_CALL_11| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 0 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|)))) is different from true [2024-11-28 02:40:52,744 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1))) (<= 0 |c_ULTIMATE.start_sll_append_~last~0#1.offset|) (not (= .cse2 0)) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) 0) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse3) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse4 (select |v_#valid_BEFORE_CALL_12| .cse4)))) (= (select |v_#valid_BEFORE_CALL_11| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 0 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|)))) is different from false [2024-11-28 02:40:52,748 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1))) (<= 0 |c_ULTIMATE.start_sll_append_~last~0#1.offset|) (not (= .cse2 0)) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) 0) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse3) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse4 (select |v_#valid_BEFORE_CALL_12| .cse4)))) (= (select |v_#valid_BEFORE_CALL_11| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 0 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|)))) is different from true [2024-11-28 02:40:52,806 INFO L349 Elim1Store]: treesize reduction 59, result has 15.7 percent of original size [2024-11-28 02:40:52,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 220 treesize of output 104 [2024-11-28 02:40:52,878 INFO L349 Elim1Store]: treesize reduction 47, result has 39.7 percent of original size [2024-11-28 02:40:52,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 35 [2024-11-28 02:40:52,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:40:52,889 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 75 treesize of output 35 [2024-11-28 02:40:52,956 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (let ((.cse3 (= .cse2 .cse1))) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1))) (not (= .cse2 0)) (let ((.cse4 (select |c_#memory_$Pointer$#2.offset| .cse2))) (or (and .cse3 (<= 0 (select .cse4 4))) (and (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_35| Int)) (and (<= 0 (select .cse4 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_35| 4))) (<= 0 |v_ULTIMATE.start_sll_append_~last~0#1.offset_35|))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0)))) (or .cse3 (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse5) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse6 (select |v_#valid_BEFORE_CALL_12| .cse6)))) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2024-11-28 02:40:52,961 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (let ((.cse3 (= .cse2 .cse1))) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1))) (not (= .cse2 0)) (let ((.cse4 (select |c_#memory_$Pointer$#2.offset| .cse2))) (or (and .cse3 (<= 0 (select .cse4 4))) (and (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_35| Int)) (and (<= 0 (select .cse4 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_35| 4))) (<= 0 |v_ULTIMATE.start_sll_append_~last~0#1.offset_35|))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0)))) (or .cse3 (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse5) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse6 (select |v_#valid_BEFORE_CALL_12| .cse6)))) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2024-11-28 02:40:53,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:40:53,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 112 [2024-11-28 02:40:53,066 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 02:40:53,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 02:40:53,087 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| .cse2))) (or (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_35| Int)) (and (<= 0 (select .cse0 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_35| 4))) (<= 0 |v_ULTIMATE.start_sll_append_~last~0#1.offset_35|)))) (and (<= 0 (select .cse0 4)) .cse1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#2| .cse2) 0) 1) .cse1) (not (= .cse2 0)) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse3 (select |v_old(#valid)_AFTER_CALL_23| .cse3))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0)))))) is different from false [2024-11-28 02:40:53,091 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| .cse2))) (or (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_35| Int)) (and (<= 0 (select .cse0 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_35| 4))) (<= 0 |v_ULTIMATE.start_sll_append_~last~0#1.offset_35|)))) (and (<= 0 (select .cse0 4)) .cse1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#2| .cse2) 0) 1) .cse1) (not (= .cse2 0)) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse3 (select |v_old(#valid)_AFTER_CALL_23| .cse3))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0)))))) is different from true [2024-11-28 02:40:53,212 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 88 treesize of output 56 [2024-11-28 02:40:53,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:40:53,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:40:53,237 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 1 case distinctions, treesize of input 40 treesize of output 30 [2024-11-28 02:40:53,312 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_main_~temp~2#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_14| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~temp~2#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_main_~temp~2#1.base| 0)) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from false [2024-11-28 02:40:53,315 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_main_~temp~2#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_14| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~temp~2#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_main_~temp~2#1.base| 0)) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from true [2024-11-28 02:40:53,360 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int)) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_#valid_BEFORE_CALL_14| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1)) is different from false [2024-11-28 02:40:53,363 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int)) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_#valid_BEFORE_CALL_14| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1)) is different from true [2024-11-28 02:40:53,490 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2024-11-28 02:40:53,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:41:45,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585210011] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:41:45,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:41:45,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 52 [2024-11-28 02:41:45,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035765221] [2024-11-28 02:41:45,207 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:41:45,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-28 02:41:45,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:41:45,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-28 02:41:45,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1749, Unknown=44, NotChecked=1700, Total=3660 [2024-11-28 02:41:45,210 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 52 states, 50 states have (on average 1.36) internal successors, (68), 43 states have internal predecessors, (68), 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 02:41:46,625 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (let ((.cse0 (= .cse3 1))) (and .cse0 (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0))) (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse0 (exists ((|v_#memory_int#2_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int#2_BEFORE_CALL_8| |c_#memory_int#2|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_8| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= (store |v_#memory_int#2_BEFORE_CALL_8| .cse2 (select |c_#memory_int#2| .cse2)) |c_#memory_int#2|) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse2))))) (= |c_ULTIMATE.start_main_~data~0#1| .cse3) (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| 0)) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~data#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)))) is different from false [2024-11-28 02:41:46,633 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (let ((.cse0 (= .cse3 1))) (and .cse0 (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0))) (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse0 (exists ((|v_#memory_int#2_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int#2_BEFORE_CALL_8| |c_#memory_int#2|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_8| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= (store |v_#memory_int#2_BEFORE_CALL_8| .cse2 (select |c_#memory_int#2| .cse2)) |c_#memory_int#2|) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse2))))) (= |c_ULTIMATE.start_main_~data~0#1| .cse3) (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| 0)) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~data#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)))) is different from true [2024-11-28 02:41:46,643 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse1 (= .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse0 (select (select |c_#memory_int#2| .cse2) 0))) (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_main_~data~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (or .cse1 (= .cse0 1)) (= (select |c_#valid| .cse2) 1) (not (= .cse2 0)) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse2) 1) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse3 (select |c_#valid| .cse3)))))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from false [2024-11-28 02:41:46,650 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse1 (= .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse0 (select (select |c_#memory_int#2| .cse2) 0))) (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_main_~data~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (or .cse1 (= .cse0 1)) (= (select |c_#valid| .cse2) 1) (not (= .cse2 0)) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse2) 1) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse3 (select |c_#valid| .cse3)))))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from true [2024-11-28 02:41:46,661 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse1 (= .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse0 (select (select |c_#memory_int#2| .cse2) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_main_~data~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (or .cse1 (= .cse0 1)) (= (select |c_#valid| .cse2) 1) (not (= .cse2 0)) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse2) 1) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse3 (select |c_#valid| .cse3)))))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from false [2024-11-28 02:41:46,667 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse1 (= .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse0 (select (select |c_#memory_int#2| .cse2) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_main_~data~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (or .cse1 (= .cse0 1)) (= (select |c_#valid| .cse2) 1) (not (= .cse2 0)) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse2) 1) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse3 (select |c_#valid| .cse3)))))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from true [2024-11-28 02:41:46,676 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_int#2| .cse0) 0)) (.cse2 (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse1 1) .cse2) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse3 (select |c_#valid| .cse3)))))) (not .cse2)))) is different from false [2024-11-28 02:41:46,681 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_int#2| .cse0) 0)) (.cse2 (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse1 1) .cse2) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse3 (select |c_#valid| .cse3)))))) (not .cse2)))) is different from true [2024-11-28 02:41:46,689 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse0 (select .cse3 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select |c_#valid| .cse0) 1) (not (= .cse1 0)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse1 .cse0) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 0) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse4 (select |c_#valid| .cse4)))) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select |c_#valid| .cse2) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select |c_#valid| .cse5) 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse6 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse2) 0)) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-11-28 02:41:46,695 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse0 (select .cse3 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select |c_#valid| .cse0) 1) (not (= .cse1 0)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse1 .cse0) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 0) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse4 (select |c_#valid| .cse4)))) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select |c_#valid| .cse2) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select |c_#valid| .cse5) 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse6 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse2) 0)) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-11-28 02:41:46,703 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_12| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-28 02:41:46,708 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_12| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-28 02:41:46,720 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (@diff |c_old(#memory_int#2)| |c_#memory_int#2|))) (let ((.cse0 (store |c_old(#memory_int#2)| .cse6 (select |c_#memory_int#2| .cse6)))) (let ((.cse2 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse1 (@diff .cse0 |c_#memory_int#2|)) (.cse5 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_#memory_int#2| (store .cse0 .cse1 (select |c_#memory_int#2| .cse1))) (= |c_node_create_#res#1.offset| 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 0)) (or (= (select |c_old(#valid)| .cse2) 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse2 (select |c_#memory_$Pointer$#2.offset| .cse2)) |c_#memory_$Pointer$#2.offset|) (not (= |c_node_create_#res#1.base| 0)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse3) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse4 (select |v_#valid_BEFORE_CALL_12| .cse4)))) (= (select |v_#valid_BEFORE_CALL_11| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (exists ((|v_node_create_~temp~0#1.base_69| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_69| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_69|)) |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_69|) 0) (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_69| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_69|))) (= (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_69| (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_69|)) |c_#memory_int#2|))) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse5) 0)) (or (= .cse0 |c_#memory_int#2|) (= (select |c_old(#valid)| .cse1) 0)) (= (store |c_old(#memory_$Pointer$#2.base)| .cse5 (select |c_#memory_$Pointer$#2.base| .cse5)) |c_#memory_$Pointer$#2.base|) (<= 0 |c_node_create_#res#1.offset|) (or (= (select |c_old(#valid)| .cse6) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|)))))) is different from false [2024-11-28 02:41:46,729 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (@diff |c_old(#memory_int#2)| |c_#memory_int#2|))) (let ((.cse0 (store |c_old(#memory_int#2)| .cse6 (select |c_#memory_int#2| .cse6)))) (let ((.cse2 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse1 (@diff .cse0 |c_#memory_int#2|)) (.cse5 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_#memory_int#2| (store .cse0 .cse1 (select |c_#memory_int#2| .cse1))) (= |c_node_create_#res#1.offset| 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 0)) (or (= (select |c_old(#valid)| .cse2) 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse2 (select |c_#memory_$Pointer$#2.offset| .cse2)) |c_#memory_$Pointer$#2.offset|) (not (= |c_node_create_#res#1.base| 0)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse3) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse4 (select |v_#valid_BEFORE_CALL_12| .cse4)))) (= (select |v_#valid_BEFORE_CALL_11| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (exists ((|v_node_create_~temp~0#1.base_69| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_69| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_69|)) |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_69|) 0) (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_69| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_69|))) (= (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_69| (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_69|)) |c_#memory_int#2|))) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse5) 0)) (or (= .cse0 |c_#memory_int#2|) (= (select |c_old(#valid)| .cse1) 0)) (= (store |c_old(#memory_$Pointer$#2.base)| .cse5 (select |c_#memory_$Pointer$#2.base| .cse5)) |c_#memory_$Pointer$#2.base|) (<= 0 |c_node_create_#res#1.offset|) (or (= (select |c_old(#valid)| .cse6) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|)))))) is different from true [2024-11-28 02:41:46,748 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse1 (select .cse4 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1))) (not (= .cse2 0)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse3 (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse6) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse7 (select |v_#valid_BEFORE_CALL_12| .cse7)))) (= (select |v_#valid_BEFORE_CALL_11| .cse6) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |c_ULTIMATE.start_sll_append_#t~ret7#1.offset|) (= (select .cse8 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse3) 0)) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-11-28 02:41:46,755 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse1 (select .cse4 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1))) (not (= .cse2 0)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse3 (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse6) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse7 (select |v_#valid_BEFORE_CALL_12| .cse7)))) (= (select |v_#valid_BEFORE_CALL_11| .cse6) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |c_ULTIMATE.start_sll_append_#t~ret7#1.offset|) (= (select .cse8 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse3) 0)) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-11-28 02:41:46,775 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse1 (select .cse4 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1))) (not (= .cse2 0)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse3 (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse6) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse7 (select |v_#valid_BEFORE_CALL_12| .cse7)))) (= (select |v_#valid_BEFORE_CALL_11| .cse6) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse8 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse3) 0)) (<= 0 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-11-28 02:41:46,782 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse1 (select .cse4 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1))) (not (= .cse2 0)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse3 (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse6) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse7 (select |v_#valid_BEFORE_CALL_12| .cse7)))) (= (select |v_#valid_BEFORE_CALL_11| .cse6) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse8 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse3) 0)) (<= 0 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-11-28 02:41:46,798 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse3 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1))) (not (= .cse2 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse5) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse6 (select |v_#valid_BEFORE_CALL_12| .cse6)))) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse4) 0)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse7 0) 0) (<= 0 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-11-28 02:41:46,805 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse3 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1))) (not (= .cse2 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse5) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse6 (select |v_#valid_BEFORE_CALL_12| .cse6)))) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse4) 0)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse7 0) 0) (<= 0 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-11-28 02:41:46,822 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse3 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1))) (not (= .cse2 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse5) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse6 (select |v_#valid_BEFORE_CALL_12| .cse6)))) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse4) 0)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse7 0) 0) (<= 0 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-11-28 02:41:46,829 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse3 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1))) (not (= .cse2 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse5) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse6 (select |v_#valid_BEFORE_CALL_12| .cse6)))) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse4) 0)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse7 0) 0) (<= 0 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-11-28 02:41:46,842 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select .cse8 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1))) (<= 0 |c_ULTIMATE.start_sll_append_~last~0#1.offset|) (not (= .cse2 0)) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (not (= .cse4 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse5) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse6 (select |v_#valid_BEFORE_CALL_12| .cse6)))) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= (select .cse7 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse4)) (not (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (<= 0 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-11-28 02:41:46,850 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select .cse8 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1))) (<= 0 |c_ULTIMATE.start_sll_append_~last~0#1.offset|) (not (= .cse2 0)) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (not (= .cse4 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse5) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse6 (select |v_#valid_BEFORE_CALL_12| .cse6)))) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= (select .cse7 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse4)) (not (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (<= 0 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-11-28 02:41:46,869 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select .cse9 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse3 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse3) |c_ULTIMATE.start_sll_append_#t~mem10#1.base|) (<= 0 |c_ULTIMATE.start_sll_append_~last~0#1.offset|) (not (= .cse2 0)) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse4) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (not (= .cse5 .cse3)) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse3) |c_ULTIMATE.start_sll_append_#t~mem10#1.offset|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse6) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse7 (select |v_#valid_BEFORE_CALL_12| .cse7)))) (= (select |v_#valid_BEFORE_CALL_11| .cse6) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= (select .cse8 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse5)) (not (= .cse4 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (<= 0 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-11-28 02:41:46,877 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select .cse9 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse3 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse3) |c_ULTIMATE.start_sll_append_#t~mem10#1.base|) (<= 0 |c_ULTIMATE.start_sll_append_~last~0#1.offset|) (not (= .cse2 0)) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse4) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (not (= .cse5 .cse3)) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse3) |c_ULTIMATE.start_sll_append_#t~mem10#1.offset|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse6) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse7 (select |v_#valid_BEFORE_CALL_12| .cse7)))) (= (select |v_#valid_BEFORE_CALL_11| .cse6) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= (select .cse8 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse5)) (not (= .cse4 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (<= 0 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-11-28 02:41:46,894 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select .cse9 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse3 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1))) (<= 0 |c_ULTIMATE.start_sll_append_~last~0#1.offset|) (not (= .cse2 0)) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse3) 0) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse4) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (not (= .cse5 .cse3)) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse6) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse7 (select |v_#valid_BEFORE_CALL_12| .cse7)))) (= (select |v_#valid_BEFORE_CALL_11| .cse6) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= (select .cse8 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse5)) (not (= .cse4 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (<= 0 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-11-28 02:41:46,902 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select .cse9 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse3 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1))) (<= 0 |c_ULTIMATE.start_sll_append_~last~0#1.offset|) (not (= .cse2 0)) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse3) 0) (or (= .cse2 .cse1) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse4) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (not (= .cse5 .cse3)) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse6) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse7 (select |v_#valid_BEFORE_CALL_12| .cse7)))) (= (select |v_#valid_BEFORE_CALL_11| .cse6) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= (select .cse8 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse5)) (not (= .cse4 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (<= 0 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-11-28 02:41:46,957 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse1 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (let ((.cse5 (= .cse4 .cse3)) (.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select |c_#memory_int#2| (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4)))) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |v_old(#valid)_AFTER_CALL_23| .cse2))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 1))) (not (= .cse4 0)) (let ((.cse6 (select |c_#memory_$Pointer$#2.offset| .cse4))) (or (and .cse5 (<= 0 (select .cse6 4))) (and (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_35| Int)) (and (<= 0 (select .cse6 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_35| 4))) (<= 0 |v_ULTIMATE.start_sll_append_~last~0#1.offset_35|))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0)))) (or .cse5 (= (select (select |c_#memory_int#2| .cse4) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse7) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse8 (select |v_#valid_BEFORE_CALL_12| .cse8)))) (= (select |v_#valid_BEFORE_CALL_11| .cse7) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= (select .cse9 0) 0) (= (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2024-11-28 02:41:46,964 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse1 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (let ((.cse5 (= .cse4 .cse3)) (.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select |c_#memory_int#2| (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4)))) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |v_old(#valid)_AFTER_CALL_23| .cse2))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 1))) (not (= .cse4 0)) (let ((.cse6 (select |c_#memory_$Pointer$#2.offset| .cse4))) (or (and .cse5 (<= 0 (select .cse6 4))) (and (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_35| Int)) (and (<= 0 (select .cse6 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_35| 4))) (<= 0 |v_ULTIMATE.start_sll_append_~last~0#1.offset_35|))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0)))) (or .cse5 (= (select (select |c_#memory_int#2| .cse4) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse7) 1) (not (= v_arrayElimCell_58 0)) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse8 (select |v_#valid_BEFORE_CALL_12| .cse8)))) (= (select |v_#valid_BEFORE_CALL_11| .cse7) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)))) (= (select .cse9 0) 0) (= (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2024-11-28 02:41:47,007 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse0 (select |c_#memory_int#2| .cse4)) (.cse3 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 .cse1)) (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| .cse4))) (or (and (= .cse1 0) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_35| Int)) (and (<= 0 (select .cse2 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_35| 4))) (<= 0 |v_ULTIMATE.start_sll_append_~last~0#1.offset_35|)))) (and (<= 0 (select .cse2 4)) .cse3))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select .cse0 0) 1) .cse3) (not (= .cse4 0)) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_old(#valid)_AFTER_CALL_23| .cse5))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0)))))) is different from false [2024-11-28 02:41:47,013 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse0 (select |c_#memory_int#2| .cse4)) (.cse3 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 .cse1)) (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| .cse4))) (or (and (= .cse1 0) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_35| Int)) (and (<= 0 (select .cse2 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_35| 4))) (<= 0 |v_ULTIMATE.start_sll_append_~last~0#1.offset_35|)))) (and (<= 0 (select .cse2 4)) .cse3))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select .cse0 0) 1) .cse3) (not (= .cse4 0)) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_old(#valid)_AFTER_CALL_23| .cse5))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0)))))) is different from true [2024-11-28 02:41:47,097 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~temp~2#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_main_~temp~2#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_14| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1))) (= (select .cse1 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 |c_ULTIMATE.start_main_~temp~2#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_main_~temp~2#1.base| 0)) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from false [2024-11-28 02:41:47,102 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~temp~2#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int)) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_main_~temp~2#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_14| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1))) (= (select .cse1 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 |c_ULTIMATE.start_main_~temp~2#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_main_~temp~2#1.base| 0)) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from true [2024-11-28 02:41:47,137 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int)) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |v_old(#valid)_AFTER_CALL_23| .cse1))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_#valid_BEFORE_CALL_14| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1))) (= (select .cse0 0) 1))) is different from false [2024-11-28 02:41:47,142 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_node_create_~temp~0#1.base_69| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int)) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |v_old(#valid)_AFTER_CALL_23| .cse1))) |v_old(#valid)_AFTER_CALL_23|) (= (select |v_old(#valid)_AFTER_CALL_23| |v_node_create_~temp~0#1.base_69|) 0) (= (select |v_#valid_BEFORE_CALL_14| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1))) (= (select .cse0 0) 1))) is different from true [2024-11-28 02:41:47,410 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (let ((.cse0 (= .cse3 1))) (and .cse0 (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0))) (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse0 (exists ((|v_#memory_int#2_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int#2_BEFORE_CALL_8| |c_#memory_int#2|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_8| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= (store |v_#memory_int#2_BEFORE_CALL_8| .cse2 (select |c_#memory_int#2| .cse2)) |c_#memory_int#2|) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse2))))) (= |c_ULTIMATE.start_main_~data~0#1| .cse3) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)))) is different from false [2024-11-28 02:41:47,416 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (let ((.cse0 (= .cse3 1))) (and .cse0 (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0))) (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse0 (exists ((|v_#memory_int#2_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int#2_BEFORE_CALL_8| |c_#memory_int#2|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_8| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= (store |v_#memory_int#2_BEFORE_CALL_8| .cse2 (select |c_#memory_int#2| .cse2)) |c_#memory_int#2|) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse2))))) (= |c_ULTIMATE.start_main_~data~0#1| .cse3) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)))) is different from true [2024-11-28 02:41:47,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:41:47,690 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2024-11-28 02:41:47,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-28 02:41:47,691 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 1.36) internal successors, (68), 43 states have internal predecessors, (68), 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 43 [2024-11-28 02:41:47,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:41:47,692 INFO L225 Difference]: With dead ends: 83 [2024-11-28 02:41:47,692 INFO L226 Difference]: Without dead ends: 81 [2024-11-28 02:41:47,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 36 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 54.1s TimeCoverageRelationStatistics Valid=229, Invalid=2089, Unknown=82, NotChecked=4572, Total=6972 [2024-11-28 02:41:47,696 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 2580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2093 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:41:47,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 515 Invalid, 2580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 477 Invalid, 0 Unknown, 2093 Unchecked, 1.3s Time] [2024-11-28 02:41:47,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-28 02:41:47,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-28 02:41:47,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 71 states have (on average 1.1408450704225352) internal successors, (81), 71 states have internal predecessors, (81), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 02:41:47,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2024-11-28 02:41:47,721 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 43 [2024-11-28 02:41:47,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:41:47,722 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2024-11-28 02:41:47,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 1.36) internal successors, (68), 43 states have internal predecessors, (68), 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 02:41:47,722 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2024-11-28 02:41:47,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-28 02:41:47,723 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:41:47,723 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-28 02:41:47,738 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 02:41:47,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-28 02:41:47,924 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:41:47,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:41:47,924 INFO L85 PathProgramCache]: Analyzing trace with hash -906623826, now seen corresponding path program 1 times [2024-11-28 02:41:47,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:41:47,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179507048] [2024-11-28 02:41:47,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:41:47,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:41:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:41:52,348 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:41:52,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:41:52,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179507048] [2024-11-28 02:41:52,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179507048] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:41:52,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884859171] [2024-11-28 02:41:52,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:41:52,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:41:52,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:41:52,350 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:41:52,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 02:41:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:41:52,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 120 conjuncts are in the unsatisfiable core [2024-11-28 02:41:52,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:41:52,885 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 02:41:53,669 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 02:41:53,670 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 02:41:53,881 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 02:41:53,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 02:41:54,608 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 02:41:54,616 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 02:41:54,624 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 02:41:55,517 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 02:41:55,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-28 02:41:55,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:41:55,558 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 38 treesize of output 27 [2024-11-28 02:41:55,628 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-28 02:41:55,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-28 02:41:57,355 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-11-28 02:41:57,355 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 170 treesize of output 84 [2024-11-28 02:41:57,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 15 [2024-11-28 02:41:57,685 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 94 treesize of output 62 [2024-11-28 02:41:57,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:41:57,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-28 02:41:58,544 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:41:58,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2024-11-28 02:41:58,555 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:41:58,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:42:01,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884859171] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:42:01,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:42:01,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 49 [2024-11-28 02:42:01,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104060397] [2024-11-28 02:42:01,134 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:42:01,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-28 02:42:01,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:42:01,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-28 02:42:01,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3021, Unknown=1, NotChecked=0, Total=3192 [2024-11-28 02:42:01,137 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand has 49 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 40 states have internal predecessors, (69), 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 02:42:08,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:42:08,201 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2024-11-28 02:42:08,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-28 02:42:08,203 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 40 states have internal predecessors, (69), 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 45 [2024-11-28 02:42:08,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:42:08,204 INFO L225 Difference]: With dead ends: 102 [2024-11-28 02:42:08,204 INFO L226 Difference]: Without dead ends: 99 [2024-11-28 02:42:08,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=326, Invalid=5373, Unknown=1, NotChecked=0, Total=5700 [2024-11-28 02:42:08,206 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 39 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:42:08,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 683 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-28 02:42:08,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-28 02:42:08,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 83. [2024-11-28 02:42:08,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 73 states have internal predecessors, (83), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 02:42:08,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2024-11-28 02:42:08,239 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 45 [2024-11-28 02:42:08,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:42:08,240 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2024-11-28 02:42:08,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 40 states have internal predecessors, (69), 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 02:42:08,240 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2024-11-28 02:42:08,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-28 02:42:08,242 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:42:08,242 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:42:08,255 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 02:42:08,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-28 02:42:08,442 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:42:08,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:42:08,443 INFO L85 PathProgramCache]: Analyzing trace with hash 167515637, now seen corresponding path program 3 times [2024-11-28 02:42:08,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:42:08,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988200046] [2024-11-28 02:42:08,443 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 02:42:08,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:42:08,483 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-28 02:42:08,484 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:42:13,607 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 02:42:13,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:42:13,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988200046] [2024-11-28 02:42:13,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988200046] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:42:13,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743417374] [2024-11-28 02:42:13,608 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 02:42:13,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:42:13,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:42:13,611 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:42:13,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 02:42:13,989 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-28 02:42:13,989 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:42:13,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-11-28 02:42:13,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:42:14,171 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 02:42:14,396 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 02:42:14,414 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 02:42:15,103 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 02:42:15,104 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 02:42:15,127 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 02:42:15,140 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 02:42:15,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-28 02:42:15,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2024-11-28 02:42:16,188 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-28 02:42:16,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 27 [2024-11-28 02:42:16,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-28 02:42:16,205 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 02:42:16,434 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_85| Int)) (and (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_85|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_85| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_85|)) |c_#memory_$Pointer$#2.offset|) (= |c_#memory_$Pointer$#2.base| (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_85| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_85|))))) is different from true [2024-11-28 02:42:16,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:42:16,533 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-28 02:42:16,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 75 [2024-11-28 02:42:16,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:42:16,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:42:16,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 47 treesize of output 45 [2024-11-28 02:42:16,605 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-28 02:42:16,605 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 02:42:16,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 69 [2024-11-28 02:42:17,573 INFO L349 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2024-11-28 02:42:17,573 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 31 [2024-11-28 02:42:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-11-28 02:42:17,851 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:42:19,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743417374] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:42:19,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:42:19,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20] total 41 [2024-11-28 02:42:19,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262545237] [2024-11-28 02:42:19,215 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:42:19,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-28 02:42:19,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:42:19,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-28 02:42:19,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1863, Unknown=1, NotChecked=86, Total=2070 [2024-11-28 02:42:19,218 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand has 41 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 34 states have internal predecessors, (69), 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 02:42:24,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:42:24,854 INFO L93 Difference]: Finished difference Result 131 states and 150 transitions. [2024-11-28 02:42:24,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 02:42:24,854 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 34 states have internal predecessors, (69), 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 46 [2024-11-28 02:42:24,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:42:24,855 INFO L225 Difference]: With dead ends: 131 [2024-11-28 02:42:24,856 INFO L226 Difference]: Without dead ends: 108 [2024-11-28 02:42:24,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=223, Invalid=3440, Unknown=1, NotChecked=118, Total=3782 [2024-11-28 02:42:24,858 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:42:24,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 363 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 854 Invalid, 0 Unknown, 64 Unchecked, 2.5s Time] [2024-11-28 02:42:24,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-28 02:42:24,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 93. [2024-11-28 02:42:24,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.1219512195121952) internal successors, (92), 82 states have internal predecessors, (92), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-28 02:42:24,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2024-11-28 02:42:24,891 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 46 [2024-11-28 02:42:24,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:42:24,891 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2024-11-28 02:42:24,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 34 states have internal predecessors, (69), 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 02:42:24,892 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2024-11-28 02:42:24,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-28 02:42:24,893 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:42:24,893 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1] [2024-11-28 02:42:24,902 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 02:42:25,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-28 02:42:25,094 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:42:25,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:42:25,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1959361589, now seen corresponding path program 2 times [2024-11-28 02:42:25,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:42:25,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340757446] [2024-11-28 02:42:25,094 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:42:25,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:42:25,133 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:42:25,133 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:42:30,250 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:42:30,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:42:30,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340757446] [2024-11-28 02:42:30,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340757446] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:42:30,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163847757] [2024-11-28 02:42:30,250 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:42:30,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:42:30,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:42:30,253 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:42:30,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 02:42:30,534 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:42:30,534 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:42:30,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 151 conjuncts are in the unsatisfiable core [2024-11-28 02:42:30,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:42:30,822 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 02:42:31,396 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 02:42:31,423 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 02:42:32,192 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 02:42:32,192 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 02:42:32,270 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 02:42:32,271 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 02:42:32,349 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 02:42:32,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 02:42:32,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-28 02:42:32,635 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 22 [2024-11-28 02:42:33,524 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 02:42:33,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 31 [2024-11-28 02:42:33,535 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 02:42:33,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-28 02:42:34,080 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 02:42:34,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:42:34,520 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-28 02:42:34,520 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 64 treesize of output 47 [2024-11-28 02:42:34,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:42:34,628 INFO L349 Elim1Store]: treesize reduction 68, result has 28.4 percent of original size [2024-11-28 02:42:34,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 40 [2024-11-28 02:42:34,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:42:34,719 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-28 02:42:34,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-28 02:42:36,811 INFO L349 Elim1Store]: treesize reduction 104, result has 20.6 percent of original size [2024-11-28 02:42:36,811 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 89 treesize of output 57 [2024-11-28 02:42:36,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:42:36,947 INFO L349 Elim1Store]: treesize reduction 180, result has 18.2 percent of original size [2024-11-28 02:42:36,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 61 [2024-11-28 02:42:37,003 INFO L349 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2024-11-28 02:42:37,003 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 22 treesize of output 27 [2024-11-28 02:42:37,650 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 279 treesize of output 219 [2024-11-28 02:42:41,549 INFO L349 Elim1Store]: treesize reduction 48, result has 86.2 percent of original size [2024-11-28 02:42:41,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 36 case distinctions, treesize of input 305 treesize of output 466 [2024-11-28 02:42:41,885 INFO L224 Elim1Store]: Index analysis took 297 ms [2024-11-28 02:42:44,372 INFO L349 Elim1Store]: treesize reduction 80, result has 86.9 percent of original size [2024-11-28 02:42:44,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 161 treesize of output 641 [2024-11-28 02:47:48,744 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/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 02:47:48,744 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-28 02:47:48,745 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-28 02:47:48,753 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-28 02:47:48,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:47:48,946 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_e4d484fc-1c06-498a-b28e-56647a6fca83/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:133) 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) ... 68 more [2024-11-28 02:47:48,954 INFO L158 Benchmark]: Toolchain (without parser) took 491395.41ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 118.7MB in the beginning and 617.8MB in the end (delta: -499.1MB). Peak memory consumption was 791.1MB. Max. memory is 16.1GB. [2024-11-28 02:47:48,954 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 142.6MB. Free memory is still 80.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:47:48,955 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.67ms. Allocated memory is still 142.6MB. Free memory was 118.4MB in the beginning and 100.6MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 02:47:48,955 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.38ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 98.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:47:48,955 INFO L158 Benchmark]: Boogie Preprocessor took 97.10ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 96.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:47:48,955 INFO L158 Benchmark]: RCFGBuilder took 554.71ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 80.4MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 02:47:48,956 INFO L158 Benchmark]: TraceAbstraction took 490202.48ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 80.0MB in the beginning and 617.8MB in the end (delta: -537.9MB). Peak memory consumption was 757.5MB. Max. memory is 16.1GB. [2024-11-28 02:47:48,957 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.37ms. Allocated memory is still 142.6MB. Free memory is still 80.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 470.67ms. Allocated memory is still 142.6MB. Free memory was 118.4MB in the beginning and 100.6MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.38ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 98.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 97.10ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 96.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 554.71ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 80.4MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 490202.48ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 80.0MB in the beginning and 617.8MB in the end (delta: -537.9MB). Peak memory consumption was 757.5MB. 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_e4d484fc-1c06-498a-b28e-56647a6fca83/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_e4d484fc-1c06-498a-b28e-56647a6fca83/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_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/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_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:47:52,006 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:47:52,160 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-28 02:47:52,175 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:47:52,175 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:47:52,215 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:47:52,218 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:47:52,218 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:47:52,218 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:47:52,219 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:47:52,219 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:47:52,219 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:47:52,219 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:47:52,219 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:47:52,219 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:47:52,220 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:47:52,220 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 02:47:52,220 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:47:52,220 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:47:52,220 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:47:52,220 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 02:47:52,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:47:52,220 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 02:47:52,221 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 02:47:52,221 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 02:47:52,221 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 02:47:52,221 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:47:52,221 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 02:47:52,221 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:47:52,224 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:47:52,225 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:47:52,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:47:52,225 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:47:52,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:47:52,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:47:52,225 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:47:52,226 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:47:52,226 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:47:52,226 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:47:52,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:47:52,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:47:52,227 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:47:52,227 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 02:47:52,227 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 02:47:52,228 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 02:47:52,228 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 02:47:52,228 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:47:52,228 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:47:52,228 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:47:52,229 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:47:52,229 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_e4d484fc-1c06-498a-b28e-56647a6fca83/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 ! call(reach_error())) ) 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 -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2024-11-28 02:47:52,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:47:52,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:47:52,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:47:52,651 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:47:52,652 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:47:52,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2024-11-28 02:47:56,201 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/data/4679abeeb/943e1e7574f744fcb9bcc7d4eef05e9d/FLAGe1f7927f6 [2024-11-28 02:47:56,552 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:47:56,552 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2024-11-28 02:47:56,583 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/data/4679abeeb/943e1e7574f744fcb9bcc7d4eef05e9d/FLAGe1f7927f6 [2024-11-28 02:47:56,782 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/data/4679abeeb/943e1e7574f744fcb9bcc7d4eef05e9d [2024-11-28 02:47:56,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:47:56,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:47:56,790 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:47:56,791 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:47:56,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:47:56,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:47:56" (1/1) ... [2024-11-28 02:47:56,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@102be1d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:56, skipping insertion in model container [2024-11-28 02:47:56,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:47:56" (1/1) ... [2024-11-28 02:47:56,853 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:47:57,282 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2024-11-28 02:47:57,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:47:57,307 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:47:57,372 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2024-11-28 02:47:57,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:47:57,417 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:47:57,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:57 WrapperNode [2024-11-28 02:47:57,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:47:57,420 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:47:57,420 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:47:57,420 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:47:57,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:57" (1/1) ... [2024-11-28 02:47:57,457 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:57" (1/1) ... [2024-11-28 02:47:57,483 INFO L138 Inliner]: procedures = 130, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 118 [2024-11-28 02:47:57,483 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:47:57,484 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:47:57,484 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:47:57,484 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:47:57,496 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:57" (1/1) ... [2024-11-28 02:47:57,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:57" (1/1) ... [2024-11-28 02:47:57,500 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:57" (1/1) ... [2024-11-28 02:47:57,527 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 6, 9]. 53 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 1, 4]. [2024-11-28 02:47:57,527 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:57" (1/1) ... [2024-11-28 02:47:57,527 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:57" (1/1) ... [2024-11-28 02:47:57,543 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:57" (1/1) ... [2024-11-28 02:47:57,544 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:57" (1/1) ... [2024-11-28 02:47:57,548 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:57" (1/1) ... [2024-11-28 02:47:57,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:57" (1/1) ... [2024-11-28 02:47:57,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:57" (1/1) ... [2024-11-28 02:47:57,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:47:57,559 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:47:57,559 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:47:57,559 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:47:57,560 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:57" (1/1) ... [2024-11-28 02:47:57,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:47:57,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:47:57,603 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:47:57,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:47:57,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-28 02:47:57,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-28 02:47:57,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-28 02:47:57,646 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-28 02:47:57,647 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-28 02:47:57,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 02:47:57,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:47:57,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 02:47:57,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 02:47:57,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 02:47:57,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 02:47:57,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 02:47:57,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 02:47:57,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 02:47:57,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 02:47:57,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-28 02:47:57,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-28 02:47:57,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-28 02:47:57,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-28 02:47:57,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-28 02:47:57,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-28 02:47:57,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 02:47:57,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-28 02:47:57,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-28 02:47:57,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:47:57,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:47:57,815 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:47:57,818 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:47:58,169 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-28 02:47:58,170 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:47:58,181 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:47:58,182 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-28 02:47:58,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:47:58 BoogieIcfgContainer [2024-11-28 02:47:58,182 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:47:58,185 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:47:58,185 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:47:58,191 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:47:58,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:47:56" (1/3) ... [2024-11-28 02:47:58,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed4be48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:47:58, skipping insertion in model container [2024-11-28 02:47:58,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:57" (2/3) ... [2024-11-28 02:47:58,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed4be48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:47:58, skipping insertion in model container [2024-11-28 02:47:58,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:47:58" (3/3) ... [2024-11-28 02:47:58,194 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2024-11-28 02:47:58,211 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:47:58,213 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_append_equal.i that has 2 procedures, 33 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2024-11-28 02:47:58,273 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:47:58,288 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=LoopHeads, 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;@1651725c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:47:58,289 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 02:47:58,293 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 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 02:47:58,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-28 02:47:58,302 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:58,302 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 02:47:58,303 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:47:58,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:58,308 INFO L85 PathProgramCache]: Analyzing trace with hash 359581376, now seen corresponding path program 1 times [2024-11-28 02:47:58,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:47:58,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [172483139] [2024-11-28 02:47:58,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:58,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:47:58,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:47:58,323 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:47:58,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 02:47:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:58,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-28 02:47:58,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:47:58,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 02:47:58,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-28 02:47:58,982 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 02:47:58,982 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:47:58,983 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:47:58,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172483139] [2024-11-28 02:47:58,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172483139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:58,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:58,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 02:47:58,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056367907] [2024-11-28 02:47:59,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:59,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 02:47:59,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:47:59,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 02:47:59,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:47:59,052 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 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 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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 02:47:59,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:47:59,486 INFO L93 Difference]: Finished difference Result 69 states and 96 transitions. [2024-11-28 02:47:59,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 02:47:59,489 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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 02:47:59,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:47:59,499 INFO L225 Difference]: With dead ends: 69 [2024-11-28 02:47:59,499 INFO L226 Difference]: Without dead ends: 35 [2024-11-28 02:47:59,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-28 02:47:59,508 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:47:59,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 207 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 02:47:59,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-28 02:47:59,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2024-11-28 02:47:59,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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 02:47:59,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-11-28 02:47:59,558 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 17 [2024-11-28 02:47:59,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:47:59,560 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-11-28 02:47:59,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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 02:47:59,561 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-11-28 02:47:59,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-28 02:47:59,563 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:47:59,563 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:47:59,575 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 02:47:59,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:47:59,764 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:47:59,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:59,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1737950109, now seen corresponding path program 1 times [2024-11-28 02:47:59,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:47:59,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [410268821] [2024-11-28 02:47:59,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:59,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:47:59,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:47:59,771 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:47:59,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 02:47:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:59,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-28 02:47:59,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:48:00,032 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 02:48:00,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 02:48:00,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 02:48:00,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-28 02:48:00,312 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 02:48:00,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 02:48:00,409 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 02:48:00,409 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:48:00,410 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:48:00,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410268821] [2024-11-28 02:48:00,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410268821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:48:00,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:48:00,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 02:48:00,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554000592] [2024-11-28 02:48:00,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:48:00,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 02:48:00,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:48:00,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 02:48:00,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-28 02:48:00,415 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 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 02:48:01,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:48:01,075 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2024-11-28 02:48:01,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 02:48:01,077 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 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 18 [2024-11-28 02:48:01,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:48:01,080 INFO L225 Difference]: With dead ends: 38 [2024-11-28 02:48:01,080 INFO L226 Difference]: Without dead ends: 36 [2024-11-28 02:48:01,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-28 02:48:01,082 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:48:01,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 150 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 02:48:01,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-28 02:48:01,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2024-11-28 02:48:01,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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 02:48:01,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-11-28 02:48:01,098 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 18 [2024-11-28 02:48:01,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:48:01,099 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-11-28 02:48:01,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 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 02:48:01,099 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-11-28 02:48:01,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-28 02:48:01,101 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:48:01,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:48:01,114 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 02:48:01,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:48:01,305 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:48:01,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:48:01,306 INFO L85 PathProgramCache]: Analyzing trace with hash 572255252, now seen corresponding path program 1 times [2024-11-28 02:48:01,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:48:01,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1892497838] [2024-11-28 02:48:01,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:01,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:48:01,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:48:01,309 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:48:01,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 02:48:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:01,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 02:48:01,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:48:01,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 02:48:01,460 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:48:01,460 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:48:01,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892497838] [2024-11-28 02:48:01,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892497838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:48:01,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:48:01,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:48:01,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79217938] [2024-11-28 02:48:01,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:48:01,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:48:01,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:48:01,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:48:01,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:48:01,464 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 02:48:01,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:48:01,503 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2024-11-28 02:48:01,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:48:01,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 20 [2024-11-28 02:48:01,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:48:01,505 INFO L225 Difference]: With dead ends: 58 [2024-11-28 02:48:01,505 INFO L226 Difference]: Without dead ends: 33 [2024-11-28 02:48:01,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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 02:48:01,506 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 55 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 02:48:01,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 55 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:48:01,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-28 02:48:01,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-11-28 02:48:01,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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 02:48:01,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2024-11-28 02:48:01,519 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 20 [2024-11-28 02:48:01,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:48:01,521 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-11-28 02:48:01,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 02:48:01,522 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2024-11-28 02:48:01,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 02:48:01,522 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:48:01,523 INFO L218 NwaCegarLoop]: trace histogram [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 02:48:01,534 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 02:48:01,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:48:01,724 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:48:01,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:48:01,725 INFO L85 PathProgramCache]: Analyzing trace with hash 36550079, now seen corresponding path program 1 times [2024-11-28 02:48:01,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:48:01,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1086045292] [2024-11-28 02:48:01,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:01,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:48:01,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:48:01,728 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:48:01,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 02:48:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:01,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-28 02:48:01,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:48:02,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-28 02:48:02,208 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 02:48:02,208 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:48:02,303 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 02:48:02,304 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:48:02,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086045292] [2024-11-28 02:48:02,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086045292] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:48:02,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:48:02,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 [2024-11-28 02:48:02,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336514347] [2024-11-28 02:48:02,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:48:02,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 02:48:02,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:48:02,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 02:48:02,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-28 02:48:02,307 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 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 02:48:06,422 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 02:48:10,901 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 02:48:10,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:48:10,901 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2024-11-28 02:48:10,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 02:48:10,906 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 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 28 [2024-11-28 02:48:10,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:48:10,907 INFO L225 Difference]: With dead ends: 44 [2024-11-28 02:48:10,907 INFO L226 Difference]: Without dead ends: 34 [2024-11-28 02:48:10,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-28 02:48:10,908 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:48:10,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 206 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2024-11-28 02:48:10,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-28 02:48:10,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-11-28 02:48:10,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 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 02:48:10,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2024-11-28 02:48:10,917 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 28 [2024-11-28 02:48:10,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:48:10,917 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-11-28 02:48:10,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 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 02:48:10,918 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2024-11-28 02:48:10,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 02:48:10,919 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:48:10,919 INFO L218 NwaCegarLoop]: trace histogram [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 02:48:10,930 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 02:48:11,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:48:11,120 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:48:11,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:48:11,121 INFO L85 PathProgramCache]: Analyzing trace with hash 162220257, now seen corresponding path program 1 times [2024-11-28 02:48:11,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:48:11,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [136572940] [2024-11-28 02:48:11,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:11,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:48:11,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:48:11,124 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:48:11,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 02:48:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:11,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-28 02:48:11,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:48:11,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-28 02:48:11,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:48:11,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:48:11,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 02:48:11,717 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:48:11,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136572940] [2024-11-28 02:48:11,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136572940] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:48:11,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:48:11,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 [2024-11-28 02:48:11,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965543015] [2024-11-28 02:48:11,718 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:48:11,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 02:48:11,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:48:11,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 02:48:11,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-28 02:48:11,719 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 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 02:48:15,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 02:48:20,405 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 02:48:20,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:48:20,405 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2024-11-28 02:48:20,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 02:48:20,408 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 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 28 [2024-11-28 02:48:20,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:48:20,409 INFO L225 Difference]: With dead ends: 39 [2024-11-28 02:48:20,409 INFO L226 Difference]: Without dead ends: 36 [2024-11-28 02:48:20,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-28 02:48:20,410 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:48:20,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 176 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2024-11-28 02:48:20,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-28 02:48:20,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2024-11-28 02:48:20,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 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 02:48:20,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-11-28 02:48:20,420 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 28 [2024-11-28 02:48:20,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:48:20,420 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-11-28 02:48:20,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 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 02:48:20,421 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-11-28 02:48:20,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-28 02:48:20,422 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:48:20,422 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-28 02:48:20,434 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 02:48:20,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:48:20,623 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:48:20,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:48:20,623 INFO L85 PathProgramCache]: Analyzing trace with hash 733789794, now seen corresponding path program 1 times [2024-11-28 02:48:20,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:48:20,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [291591195] [2024-11-28 02:48:20,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:20,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:48:20,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:48:20,626 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:48:20,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 02:48:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:20,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 02:48:20,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:48:20,830 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:48:20,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:48:20,933 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 02:48:20,933 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:48:20,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291591195] [2024-11-28 02:48:20,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291591195] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:48:20,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:48:20,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2024-11-28 02:48:20,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338528387] [2024-11-28 02:48:20,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:48:20,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:48:20,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:48:20,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:48:20,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:48:20,938 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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 02:48:21,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:48:21,108 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2024-11-28 02:48:21,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 02:48:21,109 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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 29 [2024-11-28 02:48:21,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:48:21,110 INFO L225 Difference]: With dead ends: 64 [2024-11-28 02:48:21,110 INFO L226 Difference]: Without dead ends: 42 [2024-11-28 02:48:21,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 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 02:48:21,111 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 3 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:48:21,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 104 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:48:21,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-28 02:48:21,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-28 02:48:21,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 02:48:21,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2024-11-28 02:48:21,123 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 29 [2024-11-28 02:48:21,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:48:21,123 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2024-11-28 02:48:21,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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 02:48:21,124 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2024-11-28 02:48:21,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-28 02:48:21,125 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:48:21,125 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:48:21,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 02:48:21,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:48:21,326 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:48:21,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:48:21,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1515477737, now seen corresponding path program 2 times [2024-11-28 02:48:21,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:48:21,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2018480521] [2024-11-28 02:48:21,328 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:48:21,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:48:21,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:48:21,330 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:48:21,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 02:48:21,597 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:48:21,598 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:48:21,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-28 02:48:21,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:48:21,718 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 02:48:21,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 02:48:22,215 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 12 treesize of output 4 [2024-11-28 02:48:22,223 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 02:48:22,467 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_33| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_node_create_~temp~0#1.base_33|)) (= |c_#memory_$Pointer$#2.base| (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_33| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_33|))))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_5|)))) is different from true [2024-11-28 02:48:22,574 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-28 02:48:22,578 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 02:48:22,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2024-11-28 02:48:22,805 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 02:48:22,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-28 02:48:23,049 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-28 02:48:23,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:48:27,278 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:48:27,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018480521] [2024-11-28 02:48:27,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018480521] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:48:27,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1308699231] [2024-11-28 02:48:27,279 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:48:27,279 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 02:48:27,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 02:48:27,290 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 02:48:27,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-28 02:48:27,761 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:48:27,761 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:48:27,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-28 02:48:27,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:48:27,943 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 02:48:28,088 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 02:48:28,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 02:48:28,980 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 02:48:28,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 11 treesize of output 3 [2024-11-28 02:48:29,269 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_41| (_ BitVec 32))) (and (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_41| (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_41|))) (= (_ bv0 1) (select |c_old(#valid)| |v_node_create_~temp~0#1.base_41|)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) (_ bv0 32)) (_ bv0 32)))) is different from true [2024-11-28 02:48:29,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:48:29,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 20 treesize of output 15 [2024-11-28 02:48:29,357 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-28 02:48:29,357 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 02:48:29,956 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 39 treesize of output 15 [2024-11-28 02:48:30,206 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 02:48:30,553 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2024-11-28 02:48:30,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:48:31,698 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_311 (Array (_ BitVec 32) (_ BitVec 32))) (|v_node_create_~temp~0#1.base_46| (_ BitVec 32)) (v_ArrVal_307 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_46| v_ArrVal_311)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_46|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 .cse1 v_ArrVal_307) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_ArrVal_307 (let ((.cse2 (bvadd (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) (_ bv4 32)))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_307 .cse2)))))))) is different from false [2024-11-28 02:48:31,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1308699231] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:48:31,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:48:31,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2024-11-28 02:48:31,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225150883] [2024-11-28 02:48:31,703 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:48:31,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-28 02:48:31,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:48:31,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-28 02:48:31,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1435, Unknown=30, NotChecked=234, Total=1806 [2024-11-28 02:48:31,706 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 33 states, 31 states have (on average 1.903225806451613) internal successors, (59), 28 states have internal predecessors, (59), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-28 02:48:36,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:48:36,318 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2024-11-28 02:48:36,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 02:48:36,319 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 1.903225806451613) internal successors, (59), 28 states have internal predecessors, (59), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 37 [2024-11-28 02:48:36,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:48:36,320 INFO L225 Difference]: With dead ends: 54 [2024-11-28 02:48:36,320 INFO L226 Difference]: Without dead ends: 45 [2024-11-28 02:48:36,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=204, Invalid=2640, Unknown=30, NotChecked=318, Total=3192 [2024-11-28 02:48:36,323 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 13 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:48:36,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 457 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 689 Invalid, 0 Unknown, 84 Unchecked, 2.8s Time] [2024-11-28 02:48:36,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-28 02:48:36,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2024-11-28 02:48:36,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 02:48:36,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2024-11-28 02:48:36,336 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 37 [2024-11-28 02:48:36,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:48:36,337 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2024-11-28 02:48:36,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 1.903225806451613) internal successors, (59), 28 states have internal predecessors, (59), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-28 02:48:36,337 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2024-11-28 02:48:36,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-28 02:48:36,338 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:48:36,338 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:48:36,345 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-11-28 02:48:36,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-28 02:48:36,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:48:36,743 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:48:36,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:48:36,744 INFO L85 PathProgramCache]: Analyzing trace with hash -946470603, now seen corresponding path program 1 times [2024-11-28 02:48:36,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:48:36,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [863644251] [2024-11-28 02:48:36,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:36,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:48:36,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:48:36,746 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:48:36,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 02:48:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:36,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-28 02:48:36,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:48:36,963 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 02:48:37,177 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 02:48:37,336 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-28 02:48:37,336 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 02:48:37,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 02:48:37,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 02:48:37,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2024-11-28 02:48:37,760 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 19 treesize of output 11 [2024-11-28 02:48:37,968 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_50| (_ BitVec 32))) (and (= |c_#memory_$Pointer$#2.base| (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_50| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_50|))) (= (_ bv0 1) (select |c_old(#valid)| |v_node_create_~temp~0#1.base_50|)) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_50| (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_50|))))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_7|)))) is different from true [2024-11-28 02:48:38,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:48:38,032 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 40 treesize of output 29 [2024-11-28 02:48:38,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:48:38,045 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 02:48:38,091 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-28 02:48:38,091 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 32 treesize of output 34 [2024-11-28 02:48:38,432 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 28 treesize of output 12 [2024-11-28 02:48:38,576 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 02:48:38,676 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 02:48:38,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 02:48:38,803 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-28 02:48:38,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:48:38,951 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_377) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2024-11-28 02:48:39,355 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (Array (_ BitVec 32) (_ BitVec 32))) (|v_node_create_~temp~0#1.base_55| (_ BitVec 32)) (v_ArrVal_383 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_384 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_55| v_ArrVal_384) (select (select (store |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_55| v_ArrVal_383) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) (_ bv4 32))) v_ArrVal_377) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_55|))))) is different from false [2024-11-28 02:48:39,358 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:48:39,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863644251] [2024-11-28 02:48:39,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863644251] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:48:39,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1849577438] [2024-11-28 02:48:39,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:39,359 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 02:48:39,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 02:48:39,360 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 02:48:39,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-28 02:48:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:39,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-28 02:48:39,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:48:40,160 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 7 [2024-11-28 02:48:40,287 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 02:48:40,552 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 02:48:40,562 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 02:48:41,094 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 02:48:41,103 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 11 treesize of output 5 [2024-11-28 02:48:41,109 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 02:48:41,504 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) (_ bv0 32)))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) (_ bv0 32))))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_node_create_~temp~0#1.base_58|)) (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_58| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_58|))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_58| (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_58|)))))) is different from true [2024-11-28 02:48:41,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:48:41,574 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 02:48:41,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:48:41,595 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 02:48:41,614 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-28 02:48:41,614 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 17 treesize of output 17 [2024-11-28 02:48:42,334 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 02:48:42,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:48:42,615 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 19 treesize of output 19 [2024-11-28 02:48:43,112 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 02:48:43,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:48:43,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27 [2024-11-28 02:48:43,391 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 02:48:43,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 02:48:43,676 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-28 02:48:43,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:48:44,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:48:44,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2024-11-28 02:48:44,637 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_arrayElimIndex_1 (_ BitVec 32)) (v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| v_arrayElimIndex_1 v_ArrVal_449) .cse0) .cse1)))) (forall ((v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| (_ bv0 32) v_ArrVal_449) .cse0) .cse1))) (or (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|))) (forall ((v_arrayElimIndex_1 (_ BitVec 32)) (v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| v_arrayElimIndex_1 v_ArrVal_449) .cse0) .cse1)))))) is different from false [2024-11-28 02:48:44,685 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (and (forall ((v_arrayElimIndex_1 (_ BitVec 32)) (v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_arrayElimIndex_1 .cse0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| v_arrayElimIndex_1 v_ArrVal_449) .cse1) .cse2)))) (forall ((v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| (_ bv0 32) v_ArrVal_449) .cse1) .cse2))) (or (forall ((v_arrayElimIndex_1 (_ BitVec 32)) (v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| v_arrayElimIndex_1 v_ArrVal_449) .cse1) .cse2))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (= .cse3 (select (select |c_#memory_$Pointer$#2.offset| .cse0) (bvadd .cse3 (_ bv4 32)))))))) is different from false [2024-11-28 02:48:48,924 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((|v_node_create_~temp~0#1.base_63| (_ BitVec 32))) (or (forall ((v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (= .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_63| v_ArrVal_455) .cse1) (bvadd .cse0 (_ bv4 32)))))) (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_1 (_ BitVec 32)) (v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_63| v_ArrVal_456) v_arrayElimIndex_1 v_ArrVal_449) .cse2) .cse3))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_63|))))) (forall ((|v_node_create_~temp~0#1.base_63| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_63|))) (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_1 (_ BitVec 32)) (v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_arrayElimIndex_1 .cse1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_63| v_ArrVal_456) v_arrayElimIndex_1 v_ArrVal_449) .cse2) .cse3)))))) (forall ((|v_node_create_~temp~0#1.base_63| (_ BitVec 32))) (or (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_63| v_ArrVal_456) (_ bv0 32) v_ArrVal_449) .cse2) .cse3))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_63|))))))) is different from false [2024-11-28 02:48:48,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1849577438] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:48:48,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:48:48,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2024-11-28 02:48:48,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237152451] [2024-11-28 02:48:48,932 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:48:48,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-28 02:48:48,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:48:48,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-28 02:48:48,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2354, Unknown=41, NotChecked=728, Total=3306 [2024-11-28 02:48:48,936 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 45 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 38 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 02:48:55,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:48:55,498 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2024-11-28 02:48:55,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 02:48:55,500 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 38 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2024-11-28 02:48:55,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:48:55,501 INFO L225 Difference]: With dead ends: 61 [2024-11-28 02:48:55,501 INFO L226 Difference]: Without dead ends: 59 [2024-11-28 02:48:55,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=303, Invalid=3974, Unknown=41, NotChecked=938, Total=5256 [2024-11-28 02:48:55,502 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 45 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:48:55,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 369 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 768 Invalid, 0 Unknown, 116 Unchecked, 2.9s Time] [2024-11-28 02:48:55,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-28 02:48:55,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2024-11-28 02:48:55,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 02:48:55,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2024-11-28 02:48:55,522 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 40 [2024-11-28 02:48:55,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:48:55,522 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2024-11-28 02:48:55,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 38 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 02:48:55,522 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2024-11-28 02:48:55,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-28 02:48:55,523 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:48:55,523 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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 02:48:55,532 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 02:48:55,730 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-11-28 02:48:55,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 02:48:55,927 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:48:55,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:48:55,927 INFO L85 PathProgramCache]: Analyzing trace with hash 974849126, now seen corresponding path program 1 times [2024-11-28 02:48:55,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:48:55,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [32454492] [2024-11-28 02:48:55,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:55,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:48:55,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:48:55,932 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:48:55,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 02:48:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:56,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-28 02:48:56,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:48:56,155 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 7 [2024-11-28 02:48:56,435 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-28 02:48:56,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-28 02:48:56,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 02:48:56,889 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 44 treesize of output 20 [2024-11-28 02:48:56,900 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 19 treesize of output 11 [2024-11-28 02:48:57,111 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_67| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_node_create_~temp~0#1.base_67|)) (= |c_#memory_$Pointer$#2.base| (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_67| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_67|))))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_9| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_9| (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_9|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_9|) (_ bv0 32)))) is different from true [2024-11-28 02:48:57,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:48:57,154 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 52 treesize of output 35 [2024-11-28 02:48:57,235 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-28 02:48:57,235 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 32 treesize of output 34 [2024-11-28 02:48:57,854 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-28 02:48:57,854 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 53 treesize of output 40 [2024-11-28 02:48:57,982 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 20 [2024-11-28 02:48:58,097 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 24 treesize of output 12 [2024-11-28 02:48:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-28 02:48:58,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:48:58,622 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|)) v_ArrVal_517) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2024-11-28 02:48:58,652 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) (_ bv4 32))) v_ArrVal_517) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2024-11-28 02:48:58,739 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (|v_node_create_~temp~0#1.base_72| (_ BitVec 32)) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_72|))) (not (= (_ bv0 32) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_72| v_ArrVal_520))) (store .cse0 (select (select .cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) (_ bv4 32))) v_ArrVal_517)) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2024-11-28 02:48:58,743 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:48:58,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32454492] [2024-11-28 02:48:58,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32454492] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:48:58,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1777574794] [2024-11-28 02:48:58,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:58,744 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 02:48:58,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 02:48:58,746 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 02:48:58,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2024-11-28 02:48:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:59,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-28 02:48:59,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:48:59,655 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 02:49:00,012 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 02:49:00,493 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 02:49:00,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-28 02:49:01,016 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-28 02:49:01,016 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 17 treesize of output 17 [2024-11-28 02:49:01,047 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 02:49:02,479 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 02:49:02,872 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-28 02:49:02,872 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 88 treesize of output 58 [2024-11-28 02:49:03,163 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 47 [2024-11-28 02:49:03,430 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:49:03,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 34 [2024-11-28 02:49:03,443 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 02:49:03,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:49:04,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:49:04,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 87 [2024-11-28 02:49:40,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1777574794] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:49:40,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:49:40,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 45 [2024-11-28 02:49:40,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816063279] [2024-11-28 02:49:40,075 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:49:40,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-28 02:49:40,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:49:40,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-28 02:49:40,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2674, Unknown=26, NotChecked=428, Total=3306 [2024-11-28 02:49:40,078 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 45 states, 43 states have (on average 1.558139534883721) internal successors, (67), 37 states have internal predecessors, (67), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 02:49:45,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:49:45,971 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2024-11-28 02:49:45,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-28 02:49:45,973 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.558139534883721) internal successors, (67), 37 states have internal predecessors, (67), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2024-11-28 02:49:45,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:49:45,973 INFO L225 Difference]: With dead ends: 64 [2024-11-28 02:49:45,973 INFO L226 Difference]: Without dead ends: 61 [2024-11-28 02:49:45,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 44.0s TimeCoverageRelationStatistics Valid=372, Invalid=5167, Unknown=27, NotChecked=596, Total=6162 [2024-11-28 02:49:45,975 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 46 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:49:45,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 504 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 777 Invalid, 0 Unknown, 60 Unchecked, 2.6s Time] [2024-11-28 02:49:45,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-28 02:49:45,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2024-11-28 02:49:45,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 02:49:45,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2024-11-28 02:49:45,992 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 42 [2024-11-28 02:49:45,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:49:45,992 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2024-11-28 02:49:45,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.558139534883721) internal successors, (67), 37 states have internal predecessors, (67), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 02:49:45,993 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2024-11-28 02:49:45,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-28 02:49:45,993 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:49:45,994 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1] [2024-11-28 02:49:45,999 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2024-11-28 02:49:46,201 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-28 02:49:46,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:49:46,394 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:49:46,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:49:46,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1890858921, now seen corresponding path program 2 times [2024-11-28 02:49:46,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:49:46,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2089315484] [2024-11-28 02:49:46,395 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:49:46,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:49:46,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:49:46,397 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:49:46,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 02:49:46,623 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:49:46,623 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:49:46,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-28 02:49:46,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:49:46,671 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 02:49:46,771 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 02:49:46,980 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 02:49:47,110 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 02:49:47,110 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 02:49:47,164 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-28 02:49:47,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-28 02:49:47,289 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 02:49:47,315 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 02:49:47,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-28 02:49:47,753 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 02:49:47,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2024-11-28 02:49:47,763 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 11 treesize of output 3 [2024-11-28 02:49:47,773 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 19 treesize of output 11 [2024-11-28 02:49:54,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:49:54,361 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 02:49:54,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:49:54,511 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-28 02:49:54,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 34 [2024-11-28 02:49:54,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:49:54,714 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-28 02:49:54,715 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 32 treesize of output 34 [2024-11-28 02:49:54,752 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 02:50:01,429 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 02:50:06,126 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 02:50:06,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-28 02:50:07,411 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 02:50:11,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:50:11,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2024-11-28 02:50:11,866 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-28 02:50:11,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 02:50:16,205 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 15 treesize of output 7 [2024-11-28 02:50:16,464 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:50:16,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:50:21,266 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_654 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_654) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2024-11-28 02:50:23,756 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_654 (Array (_ BitVec 32) (_ BitVec 32))) (|v_node_create_~temp~0#1.base_87| (_ BitVec 32))) (or (= (select (select (store (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_87| v_ArrVal_664) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse2 (bvadd (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) (_ bv4 32)))) (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_87| v_ArrVal_663))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_87| v_ArrVal_662) .cse1) .cse2) (_ bv4 32)))) v_ArrVal_654) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_87|))))) is different from false [2024-11-28 02:50:23,765 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:50:23,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089315484] [2024-11-28 02:50:23,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089315484] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:50:23,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1401882149] [2024-11-28 02:50:23,766 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:50:23,766 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 02:50:23,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 02:50:23,768 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 02:50:23,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d484fc-1c06-498a-b28e-56647a6fca83/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-11-28 02:50:24,195 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:50:24,195 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:50:24,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-11-28 02:50:24,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:50:24,643 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 7 [2024-11-28 02:50:25,877 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 02:50:27,364 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 02:50:28,103 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-28 02:50:28,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-28 02:50:28,157 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 02:50:29,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 02:50:29,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 02:50:29,087 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 22 [2024-11-28 02:50:33,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 27 [2024-11-28 02:50:33,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-28 02:50:33,965 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 02:50:33,981 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 19 treesize of output 11 [2024-11-28 02:50:35,202 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_91| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_node_create_~temp~0#1.base_91|)) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_91| (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_91|))) (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_91| (store (store (select |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_91|) (_ bv4 32) (_ bv0 32)) (_ bv0 32) (select (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_91|) (_ bv0 32))))) (= |c_#memory_$Pointer$#2.base| (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_91| (store (store (select |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_91|) (_ bv4 32) (_ bv0 32)) (_ bv0 32) (select (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_91|) (_ bv0 32))))))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_12| (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_12|) (_ bv0 32)) (_ bv0 32)))) is different from true [2024-11-28 02:50:35,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:50:35,336 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 77 treesize of output 45 [2024-11-28 02:50:35,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:50:35,457 INFO L349 Elim1Store]: treesize reduction 6, result has 66.7 percent of original size [2024-11-28 02:50:35,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 26 [2024-11-28 02:50:35,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:50:35,494 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 0 case distinctions, treesize of input 45 treesize of output 40 [2024-11-28 02:50:35,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:50:35,555 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 02:50:54,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:50:54,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:50:54,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2024-11-28 02:50:59,583 INFO L349 Elim1Store]: treesize reduction 20, result has 67.2 percent of original size [2024-11-28 02:50:59,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 69 [2024-11-28 02:51:08,401 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 02:51:10,029 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 02:51:15,054 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-28 02:51:15,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:51:15,126 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_739) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2024-11-28 02:51:34,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1401882149] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:51:34,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:51:34,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28] total 50 [2024-11-28 02:51:34,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863463645] [2024-11-28 02:51:34,128 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:51:34,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-28 02:51:34,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:51:34,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-28 02:51:34,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=3504, Unknown=52, NotChecked=492, Total=4290 [2024-11-28 02:51:34,131 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 50 states, 48 states have (on average 1.5) internal successors, (72), 42 states have internal predecessors, (72), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 02:51:41,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 02:51:53,212 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 02:52:05,408 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 02:52:14,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 02:52:23,458 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 02:52:32,419 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 02:52:35,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 02:52:44,566 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 02:52:52,100 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 02:52:56,514 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 02:53:10,244 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 02:53:14,508 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 02:53:21,647 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 02:53:25,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 02:53:30,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 02:53:34,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 02:53:38,307 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 02:53:42,375 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 02:53:46,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]