./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx --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 f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:14:16,670 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:14:16,741 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-21 22:14:16,747 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:14:16,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:14:16,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:14:16,776 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:14:16,777 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:14:16,777 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 22:14:16,778 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 22:14:16,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:14:16,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:14:16,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:14:16,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:14:16,782 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:14:16,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:14:16,783 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 22:14:16,784 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:14:16,784 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:14:16,785 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:14:16,785 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:14:16,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 22:14:16,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:14:16,787 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 22:14:16,788 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:14:16,788 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:14:16,789 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:14:16,789 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:14:16,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:14:16,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 22:14:16,791 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:14:16,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:14:16,792 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:14:16,792 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:14:16,792 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 22:14:16,793 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:14:16,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 22:14:16,794 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:14:16,794 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 22:14:16,795 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 22:14:16,795 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 22:14:16,796 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 22:14:16,796 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx 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 -> f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 [2023-11-21 22:14:17,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:14:17,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:14:17,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:14:17,160 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:14:17,160 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:14:17,161 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2023-11-21 22:14:20,288 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:14:20,568 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:14:20,569 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2023-11-21 22:14:20,595 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx/data/b46e37f87/17d8f86b633d4a74bb7a08f91c875ee6/FLAG1e8e40af0 [2023-11-21 22:14:20,611 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx/data/b46e37f87/17d8f86b633d4a74bb7a08f91c875ee6 [2023-11-21 22:14:20,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:14:20,615 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:14:20,617 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:14:20,617 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:14:20,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:14:20,624 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:14:20" (1/1) ... [2023-11-21 22:14:20,625 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@352d032c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:20, skipping insertion in model container [2023-11-21 22:14:20,625 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:14:20" (1/1) ... [2023-11-21 22:14:20,675 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:14:21,011 WARN L240 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_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i[24547,24560] [2023-11-21 22:14:21,016 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:14:21,026 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:14:21,072 WARN L240 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_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i[24547,24560] [2023-11-21 22:14:21,073 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:14:21,111 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:14:21,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:21 WrapperNode [2023-11-21 22:14:21,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:14:21,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:14:21,114 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:14:21,114 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:14:21,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:21" (1/1) ... [2023-11-21 22:14:21,155 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:21" (1/1) ... [2023-11-21 22:14:21,201 INFO L138 Inliner]: procedures = 127, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 149 [2023-11-21 22:14:21,202 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:14:21,202 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:14:21,203 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:14:21,203 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:14:21,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:21" (1/1) ... [2023-11-21 22:14:21,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:21" (1/1) ... [2023-11-21 22:14:21,221 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:21" (1/1) ... [2023-11-21 22:14:21,240 INFO L187 HeapSplitter]: Split 27 memory accesses to 3 slices as follows [2, 15, 10] [2023-11-21 22:14:21,250 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:21" (1/1) ... [2023-11-21 22:14:21,251 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:21" (1/1) ... [2023-11-21 22:14:21,261 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:21" (1/1) ... [2023-11-21 22:14:21,276 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:21" (1/1) ... [2023-11-21 22:14:21,279 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:21" (1/1) ... [2023-11-21 22:14:21,281 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:21" (1/1) ... [2023-11-21 22:14:21,288 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:14:21,290 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:14:21,290 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:14:21,291 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:14:21,292 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:21" (1/1) ... [2023-11-21 22:14:21,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:14:21,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:14:21,329 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 22:14:21,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 22:14:21,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-21 22:14:21,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-21 22:14:21,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-21 22:14:21,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-21 22:14:21,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-21 22:14:21,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-21 22:14:21,384 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-21 22:14:21,384 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-21 22:14:21,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 22:14:21,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:14:21,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 22:14:21,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-21 22:14:21,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-21 22:14:21,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-21 22:14:21,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-21 22:14:21,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-21 22:14:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-21 22:14:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:14:21,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-21 22:14:21,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-21 22:14:21,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-21 22:14:21,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 22:14:21,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-21 22:14:21,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-21 22:14:21,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:14:21,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:14:21,597 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:14:21,600 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:14:22,027 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:14:22,078 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:14:22,078 INFO L308 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-21 22:14:22,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:14:22 BoogieIcfgContainer [2023-11-21 22:14:22,080 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:14:22,082 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:14:22,082 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:14:22,085 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:14:22,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:14:20" (1/3) ... [2023-11-21 22:14:22,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c8d528a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:14:22, skipping insertion in model container [2023-11-21 22:14:22,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:21" (2/3) ... [2023-11-21 22:14:22,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c8d528a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:14:22, skipping insertion in model container [2023-11-21 22:14:22,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:14:22" (3/3) ... [2023-11-21 22:14:22,088 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal.i [2023-11-21 22:14:22,103 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:14:22,103 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-21 22:14:22,153 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:14:22,160 INFO L357 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, mHoare=true, 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;@b1ef045, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:14:22,160 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 22:14:22,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 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) [2023-11-21 22:14:22,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-21 22:14:22,176 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:14:22,176 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:22,177 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:14:22,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:22,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1044137332, now seen corresponding path program 1 times [2023-11-21 22:14:22,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:22,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130607137] [2023-11-21 22:14:22,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:22,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:22,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:14:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:22,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-21 22:14:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:22,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 22:14:22,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:22,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130607137] [2023-11-21 22:14:22,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130607137] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:22,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:14:22,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:14:22,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567099526] [2023-11-21 22:14:22,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:22,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:14:22,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:22,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:14:22,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:14:22,872 INFO L87 Difference]: Start difference. First operand has 29 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 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) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-11-21 22:14:23,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:14:23,001 INFO L93 Difference]: Finished difference Result 55 states and 80 transitions. [2023-11-21 22:14:23,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:14:23,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2023-11-21 22:14:23,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:14:23,011 INFO L225 Difference]: With dead ends: 55 [2023-11-21 22:14:23,012 INFO L226 Difference]: Without dead ends: 26 [2023-11-21 22:14:23,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:14:23,025 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:14:23,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 72 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:14:23,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-21 22:14:23,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-11-21 22:14:23,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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) [2023-11-21 22:14:23,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-11-21 22:14:23,082 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 16 [2023-11-21 22:14:23,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:14:23,084 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-11-21 22:14:23,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-11-21 22:14:23,085 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-11-21 22:14:23,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-21 22:14:23,087 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:14:23,088 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:23,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 22:14:23,089 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:14:23,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:23,091 INFO L85 PathProgramCache]: Analyzing trace with hash 347668139, now seen corresponding path program 1 times [2023-11-21 22:14:23,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:23,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155313827] [2023-11-21 22:14:23,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:23,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:23,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:14:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:23,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-21 22:14:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:23,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-21 22:14:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:23,826 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 22:14:23,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:23,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155313827] [2023-11-21 22:14:23,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155313827] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:14:23,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917807601] [2023-11-21 22:14:23,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:23,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:14:23,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:14:23,835 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:14:23,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-21 22:14:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:24,054 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-21 22:14:24,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:14:24,187 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 [2023-11-21 22:14:24,203 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 22:14:24,203 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:14:24,386 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 22:14:24,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917807601] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:14:24,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:14:24,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 13 [2023-11-21 22:14:24,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60260471] [2023-11-21 22:14:24,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:14:24,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-21 22:14:24,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:24,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-21 22:14:24,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-11-21 22:14:24,397 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-21 22:14:24,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:14:24,626 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2023-11-21 22:14:24,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:14:24,627 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 22 [2023-11-21 22:14:24,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:14:24,628 INFO L225 Difference]: With dead ends: 34 [2023-11-21 22:14:24,629 INFO L226 Difference]: Without dead ends: 26 [2023-11-21 22:14:24,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2023-11-21 22:14:24,631 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:14:24,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 174 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:14:24,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-21 22:14:24,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-11-21 22:14:24,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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) [2023-11-21 22:14:24,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2023-11-21 22:14:24,639 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 22 [2023-11-21 22:14:24,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:14:24,640 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2023-11-21 22:14:24,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-21 22:14:24,640 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2023-11-21 22:14:24,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-21 22:14:24,675 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:14:24,675 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:24,697 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-21 22:14:24,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:14:24,895 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:14:24,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:24,896 INFO L85 PathProgramCache]: Analyzing trace with hash -631196120, now seen corresponding path program 1 times [2023-11-21 22:14:24,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:24,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002774860] [2023-11-21 22:14:24,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:24,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:26,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:14:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:26,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-21 22:14:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:26,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-21 22:14:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:26,426 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 22:14:26,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:26,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002774860] [2023-11-21 22:14:26,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002774860] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:14:26,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222307340] [2023-11-21 22:14:26,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:26,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:14:26,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:14:26,435 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:14:26,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 22:14:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:26,643 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-21 22:14:26,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:14:26,659 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 [2023-11-21 22:14:26,816 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-21 22:14:26,816 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 [2023-11-21 22:14:26,870 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 [2023-11-21 22:14:26,967 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-11-21 22:14:26,967 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 70 treesize of output 57 [2023-11-21 22:14:27,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:14:27,170 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 46 treesize of output 35 [2023-11-21 22:14:27,191 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-11-21 22:14:27,192 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 [2023-11-21 22:14:27,237 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 20 [2023-11-21 22:14:27,280 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 35 treesize of output 19 [2023-11-21 22:14:27,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-21 22:14:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:14:27,311 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:14:27,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222307340] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:14:27,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-21 22:14:27,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 28 [2023-11-21 22:14:27,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425757194] [2023-11-21 22:14:27,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-21 22:14:27,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-21 22:14:27,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:27,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-21 22:14:27,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=787, Unknown=0, NotChecked=0, Total=870 [2023-11-21 22:14:27,482 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 28 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-21 22:14:28,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:14:28,246 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2023-11-21 22:14:28,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 22:14:28,247 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 25 [2023-11-21 22:14:28,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:14:28,248 INFO L225 Difference]: With dead ends: 46 [2023-11-21 22:14:28,248 INFO L226 Difference]: Without dead ends: 37 [2023-11-21 22:14:28,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=133, Invalid=1057, Unknown=0, NotChecked=0, Total=1190 [2023-11-21 22:14:28,250 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-21 22:14:28,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 243 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-21 22:14:28,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-21 22:14:28,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2023-11-21 22:14:28,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-21 22:14:28,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2023-11-21 22:14:28,263 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 25 [2023-11-21 22:14:28,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:14:28,264 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2023-11-21 22:14:28,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-21 22:14:28,265 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2023-11-21 22:14:28,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-21 22:14:28,268 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:14:28,268 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:28,294 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-21 22:14:28,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:14:28,489 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:14:28,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:28,490 INFO L85 PathProgramCache]: Analyzing trace with hash 520677837, now seen corresponding path program 1 times [2023-11-21 22:14:28,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:28,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293902036] [2023-11-21 22:14:28,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:28,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:30,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:14:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:30,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-21 22:14:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:30,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-21 22:14:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:30,983 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 22:14:30,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:30,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293902036] [2023-11-21 22:14:30,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293902036] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:14:30,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906834962] [2023-11-21 22:14:30,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:30,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:14:30,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:14:30,985 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:14:31,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-21 22:14:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:31,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 116 conjunts are in the unsatisfiable core [2023-11-21 22:14:31,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:14:31,210 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 [2023-11-21 22:14:31,510 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-21 22:14:31,511 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 [2023-11-21 22:14:31,586 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 [2023-11-21 22:14:31,688 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-21 22:14:31,688 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 54 treesize of output 41 [2023-11-21 22:14:31,948 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 [2023-11-21 22:14:32,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:14:32,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2023-11-21 22:14:32,091 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-21 22:14:32,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-21 22:14:32,678 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:14:32,679 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:14:32,683 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-11-21 22:14:32,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 19 [2023-11-21 22:14:32,943 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 73 treesize of output 40 [2023-11-21 22:14:32,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 21 [2023-11-21 22:14:32,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 8 [2023-11-21 22:14:32,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2023-11-21 22:14:33,030 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 35 treesize of output 27 [2023-11-21 22:14:33,034 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 19 [2023-11-21 22:14:33,037 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 7 [2023-11-21 22:14:33,040 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:14:33,041 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:14:33,082 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_589) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_592) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_589 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_589 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) is different from false [2023-11-21 22:14:33,245 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (or (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_589) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_592) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_589 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_589 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) (forall ((|ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| Int)) (not (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))))) is different from false [2023-11-21 22:14:33,269 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (or (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_589) .cse0 v_ArrVal_592) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_589 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_589 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_19| Int)) (not (= (select (select |c_#memory_$Pointer$#1.base| .cse0) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_19|) (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))))) is different from false [2023-11-21 22:14:33,320 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) (select .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (or (forall ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_19| Int)) (not (= (select (select |c_#memory_$Pointer$#1.base| .cse0) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_19|) .cse1))) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (or (not (= v_ArrVal_589 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_589 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_589) .cse0 v_ArrVal_592) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))))) is different from false [2023-11-21 22:14:33,351 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse3 (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse3) (select .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (or (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_589) .cse0 v_ArrVal_592) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= v_ArrVal_589 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| (select v_ArrVal_589 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_19| Int)) (not (= (select (select |c_#memory_$Pointer$#1.base| .cse0) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_19|) .cse3))))))) is different from false [2023-11-21 22:14:33,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:14:33,511 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 524 treesize of output 514 [2023-11-21 22:14:33,545 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 103 treesize of output 71 [2023-11-21 22:14:33,627 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 306 treesize of output 274 [2023-11-21 22:14:33,703 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 325 treesize of output 277 [2023-11-21 22:14:33,725 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 19 treesize of output 3 [2023-11-21 22:14:34,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906834962] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:14:34,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-21 22:14:34,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 42 [2023-11-21 22:14:34,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560397588] [2023-11-21 22:14:34,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-21 22:14:34,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-21 22:14:34,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:34,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-21 22:14:34,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1780, Unknown=5, NotChecked=440, Total=2352 [2023-11-21 22:14:34,064 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 42 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-21 22:14:37,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:14:37,145 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2023-11-21 22:14:37,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-21 22:14:37,145 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 27 [2023-11-21 22:14:37,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:14:37,147 INFO L225 Difference]: With dead ends: 56 [2023-11-21 22:14:37,147 INFO L226 Difference]: Without dead ends: 54 [2023-11-21 22:14:37,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=332, Invalid=4239, Unknown=5, NotChecked=680, Total=5256 [2023-11-21 22:14:37,151 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-21 22:14:37,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 297 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-21 22:14:37,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-21 22:14:37,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2023-11-21 22:14:37,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-21 22:14:37,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2023-11-21 22:14:37,163 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 27 [2023-11-21 22:14:37,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:14:37,164 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2023-11-21 22:14:37,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-21 22:14:37,164 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2023-11-21 22:14:37,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-21 22:14:37,165 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:14:37,166 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:37,196 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-21 22:14:37,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:14:37,379 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:14:37,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:37,380 INFO L85 PathProgramCache]: Analyzing trace with hash -2139751224, now seen corresponding path program 1 times [2023-11-21 22:14:37,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:37,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296763877] [2023-11-21 22:14:37,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:37,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:39,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:14:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:39,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-21 22:14:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:40,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-21 22:14:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:40,758 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 22:14:40,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:40,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296763877] [2023-11-21 22:14:40,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296763877] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:14:40,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293679471] [2023-11-21 22:14:40,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:40,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:14:40,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:14:40,763 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:14:40,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca9c4d67-7a8e-4b98-8d27-a6f3af39be80/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-21 22:14:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:40,992 INFO L262 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 136 conjunts are in the unsatisfiable core [2023-11-21 22:14:41,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:14:41,051 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 [2023-11-21 22:14:41,374 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 [2023-11-21 22:14:41,457 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-21 22:14:41,458 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 [2023-11-21 22:14:41,547 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 [2023-11-21 22:14:41,557 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 [2023-11-21 22:14:41,675 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-21 22:14:41,675 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 78 treesize of output 53 [2023-11-21 22:14:41,681 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 36 treesize of output 15 [2023-11-21 22:14:42,056 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-21 22:14:42,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-21 22:14:42,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:14:42,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2023-11-21 22:14:42,106 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-21 22:14:42,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-21 22:14:43,063 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2023-11-21 22:14:43,071 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 49 treesize of output 15 [2023-11-21 22:14:43,091 INFO L349 Elim1Store]: treesize reduction 61, result has 10.3 percent of original size [2023-11-21 22:14:43,092 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 124 treesize of output 80 [2023-11-21 22:14:43,125 INFO L349 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2023-11-21 22:14:43,125 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 4 case distinctions, treesize of input 119 treesize of output 87 [2023-11-21 22:14:43,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 72 [2023-11-21 22:14:43,146 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 83 treesize of output 67 [2023-11-21 22:14:43,158 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 56 treesize of output 19 [2023-11-21 22:14:43,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2023-11-21 22:14:43,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 82 [2023-11-21 22:14:43,276 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 86 treesize of output 58 [2023-11-21 22:14:43,405 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-21 22:14:43,405 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 55 treesize of output 26 [2023-11-21 22:14:43,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-21 22:14:43,543 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:14:43,544 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:14:43,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:14:43,821 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 102 [2023-11-21 22:14:43,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:14:43,842 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 204 treesize of output 207 [2023-11-21 22:14:43,853 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 88 treesize of output 74 [2023-11-21 22:14:44,102 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse13 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse10 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse2))) (let ((.cse4 (not .cse10)) (.cse9 (+ (select .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 4)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse1 (select .cse13 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (and (or (forall ((v_arrayElimCell_61 Int) (v_ArrVal_789 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_786) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_782) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse1)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_789) .cse2) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_61)))) .cse4) (or (forall ((v_arrayElimCell_61 Int) (v_ArrVal_789 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_786) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_782) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse1)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_789) .cse2) .cse5)) (+ 4 v_arrayElimCell_61))) (= .cse5 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) .cse4) (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (let ((.cse7 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_arrayElimCell_60 Int) (v_ArrVal_789 (Array Int Int)) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_786) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_782) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse1)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_789) .cse2) .cse7)))) (or (forall ((v_arrayElimCell_61 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 (+ 4 v_arrayElimCell_61)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 (+ 4 v_arrayElimCell_60)))))) (= .cse7 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (forall ((v_ArrVal_789 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_786) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_782) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse1)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_789) .cse2) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_61 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 (+ 4 v_arrayElimCell_61)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 .cse9))))) (or .cse10 (forall ((v_ArrVal_789 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_786) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_782) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse1)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_789) .cse2) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse9)))) (or (and (forall ((v_arrayElimCell_60 Int) (v_ArrVal_789 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_786) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_782) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse1)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_789) .cse2) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_61 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 (+ 4 v_arrayElimCell_61)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 (+ 4 v_arrayElimCell_60)))))) (or .cse10 (forall ((v_arrayElimCell_60 Int) (v_ArrVal_789 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_786) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_782) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse1)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_789) .cse2) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_60)))))) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse2)) (or .cse10 (forall ((v_arrayElimCell_60 Int) (v_ArrVal_789 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (let ((.cse12 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse12 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_786) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_782) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse1)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_789) .cse2) .cse12)) (+ 4 v_arrayElimCell_60)))))))))))) is different from false [2023-11-21 22:15:01,185 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse1 (select .cse14 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (or (forall ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_23| Int)) (not (= (select (select |c_#memory_$Pointer$#1.base| .cse0) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_23|) .cse1))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse14 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse12 (= .cse4 .cse0))) (let ((.cse9 (not .cse12)) (.cse8 (+ (select .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 4)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (let ((.cse5 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_arrayElimCell_60 Int) (v_ArrVal_789 (Array Int Int)) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_786) .cse0 v_ArrVal_782) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse1)) .cse0 v_ArrVal_789) .cse4) .cse5)))) (or (= (select .cse2 (+ 4 v_arrayElimCell_60)) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_61 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 (+ 4 v_arrayElimCell_61))))))) (= .cse5 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (forall ((v_ArrVal_789 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_786) .cse0 v_ArrVal_782) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse1)) .cse0 v_ArrVal_789) .cse4) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 .cse8)) (forall ((v_arrayElimCell_61 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 (+ 4 v_arrayElimCell_61))))))) (or (forall ((v_arrayElimCell_61 Int) (v_ArrVal_789 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_786) .cse0 v_ArrVal_782) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse1)) .cse0 v_ArrVal_789) .cse4) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_61)))) .cse9) (or (forall ((v_arrayElimCell_61 Int) (v_ArrVal_789 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (let ((.cse10 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_786) .cse0 v_ArrVal_782) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse1)) .cse0 v_ArrVal_789) .cse4) .cse10)) (+ 4 v_arrayElimCell_61))) (= .cse10 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) .cse9) (or (and (forall ((v_arrayElimCell_60 Int) (v_ArrVal_789 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_786) .cse0 v_ArrVal_782) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse1)) .cse0 v_ArrVal_789) .cse4) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse11 (+ 4 v_arrayElimCell_60)) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_61 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 (+ 4 v_arrayElimCell_61))))))) (or (forall ((v_arrayElimCell_60 Int) (v_ArrVal_789 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_786) .cse0 v_ArrVal_782) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse1)) .cse0 v_ArrVal_789) .cse4) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_60)) |c_ULTIMATE.start_main_~data~0#1|)) .cse12)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse4)) (or (forall ((v_ArrVal_789 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_786) .cse0 v_ArrVal_782) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse1)) .cse0 v_ArrVal_789) .cse4) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse8))) .cse12) (or (forall ((v_arrayElimCell_60 Int) (v_ArrVal_789 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (let ((.cse13 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_786) .cse0 v_ArrVal_782) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse1)) .cse0 v_ArrVal_789) .cse4) .cse13)) (+ 4 v_arrayElimCell_60)) |c_ULTIMATE.start_main_~data~0#1|) (= .cse13 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) .cse12)))))))) is different from false [2023-11-21 22:15:01,531 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse15 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse4 (select .cse15 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse14 (select .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse14))) (or (let ((.cse5 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse15 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (= .cse2 .cse5))) (let ((.cse1 (+ .cse14 4)) (.cse9 (not .cse7)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (forall ((v_ArrVal_789 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_786) .cse2 v_ArrVal_782) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_789) .cse5) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 .cse1)) (forall ((v_arrayElimCell_61 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 (+ 4 v_arrayElimCell_61))))))) (or .cse7 (forall ((v_arrayElimCell_60 Int) (v_ArrVal_789 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (let ((.cse8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_786) .cse2 v_ArrVal_782) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_789) .cse5) .cse8)) (+ 4 v_arrayElimCell_60))) (= .cse8 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))) (or (forall ((v_ArrVal_789 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_786) .cse2 v_ArrVal_782) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_789) .cse5) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse1))) .cse7) (or .cse9 (forall ((v_arrayElimCell_61 Int) (v_ArrVal_789 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (let ((.cse10 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_786) .cse2 v_ArrVal_782) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_789) .cse5) .cse10)) (+ 4 v_arrayElimCell_61))) (= .cse10 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))) (or .cse9 (forall ((v_arrayElimCell_61 Int) (v_ArrVal_789 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_786) .cse2 v_ArrVal_782) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_789) .cse5) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_61))))) (or (and (or (forall ((v_arrayElimCell_60 Int) (v_ArrVal_789 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_786) .cse2 v_ArrVal_782) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_789) .cse5) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_60)))) .cse7) (forall ((v_arrayElimCell_60 Int) (v_ArrVal_789 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_786) .cse2 v_ArrVal_782) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_789) .cse5) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 (+ 4 v_arrayElimCell_60))) (forall ((v_arrayElimCell_61 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 (+ 4 v_arrayElimCell_61)))))))) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse5)) (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (let ((.cse13 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_arrayElimCell_60 Int) (v_ArrVal_789 (Array Int Int)) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_786) .cse2 v_ArrVal_782) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_789) .cse5) .cse13)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 (+ 4 v_arrayElimCell_60))) (forall ((v_arrayElimCell_61 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 (+ 4 v_arrayElimCell_61))))))) (= .cse13 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_23| Int)) (not (= (select (select |c_#memory_$Pointer$#1.base| .cse2) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_23|) .cse4))))))) is different from false [2023-11-21 22:15:01,767 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse15 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse3 (select .cse15 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse14 (select .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse14))) (or (let ((.cse4 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse15 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (= .cse1 .cse4))) (let ((.cse8 (+ .cse14 4)) (.cse13 (not .cse0)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|))) (and (or .cse0 (forall ((v_arrayElimCell_60 Int) (v_ArrVal_789 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_786) .cse1 v_ArrVal_782) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_789) .cse4) .cse5)) (+ 4 v_arrayElimCell_60))) (= .cse5 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))) (forall ((v_ArrVal_789 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_786) .cse1 v_ArrVal_782) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_789) .cse4) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 .cse8)) (forall ((v_arrayElimCell_61 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 (+ 4 v_arrayElimCell_61))))))) (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (let ((.cse9 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse9 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (forall ((v_arrayElimCell_60 Int) (v_ArrVal_789 (Array Int Int)) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_786) .cse1 v_ArrVal_782) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_789) .cse4) .cse9)))) (or (forall ((v_arrayElimCell_61 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 (+ 4 v_arrayElimCell_61)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 (+ 4 v_arrayElimCell_60))))))))) (or (and (forall ((v_arrayElimCell_60 Int) (v_ArrVal_789 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_786) .cse1 v_ArrVal_782) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_789) .cse4) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_61 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 (+ 4 v_arrayElimCell_61)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 (+ 4 v_arrayElimCell_60)))))) (or (forall ((v_arrayElimCell_60 Int) (v_ArrVal_789 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_786) .cse1 v_ArrVal_782) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_789) .cse4) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_60)))) .cse0)) (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse4)) (or (forall ((v_arrayElimCell_61 Int) (v_ArrVal_789 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (let ((.cse12 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_786) .cse1 v_ArrVal_782) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_789) .cse4) .cse12)) (+ 4 v_arrayElimCell_61))) (= .cse12 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) .cse13) (or (forall ((v_ArrVal_789 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_786) .cse1 v_ArrVal_782) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_789) .cse4) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse8))) .cse0) (or .cse13 (forall ((v_arrayElimCell_61 Int) (v_ArrVal_789 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_786) .cse1 v_ArrVal_782) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_789) .cse4) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_61))))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_23| Int)) (not (= (select (select |c_#memory_$Pointer$#1.base| .cse1) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_23|) .cse3))))))) is different from false